EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Topological well-orderedness for root-cause identification in networks: canonical explanations via upper-bound graphs

Mustafa Burç Kandemir

Applied General Topology · 13.07.2026 · 27 (2) · 25340

DOI: 10.4995/agt.25340 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied General Topology, online erschienen am 13.07.2026. Verfasst von Mustafa Burç Kandemir. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We introduce topological well-orderedness (TWO) for triples ( X , T , ≤ ) , requiring that every nonempty open set admits a least element. For each open set U, we define the upper-bound graph UB(U) by joining x , y ∈ U whenever they share an upper bound in U, and study its clique complex together with an associated upper-bound simplicial complex. Our main results show that TWO yields canonical dominating-vertex certificates, implying that these complexes are cones and hence contractible. Consequently, their reduced homology vanishes in all dimensions, providing a simple topological invariant for well-ordered open-set dynamics. We further examine filtrations induced by nested observations and discuss implications for persistent homology, including stability under monotone unions. A toy network-diagnostics example illustrates how the framework supports canonical explanations in root-cause identification.

Zitieren

APA

Kandemir, M. B. (2026). Topological well-orderedness for root-cause identification in networks: canonical explanations via upper-bound graphs. Applied General Topology, 27(2), 25340. https://doi.org/10.4995/agt.25340

Vancouver

Kandemir MB. Topological well-orderedness for root-cause identification in networks: canonical explanations via upper-bound graphs. Applied General Topology. 2026;27(2):25340. doi:10.4995/agt.25340

BibTeX
@article{Kandemir2026,
  author = {Kandemir, Mustafa Burç},
  title = {Topological well-orderedness for root-cause identification in networks: canonical explanations via upper-bound graphs},
  journal = {Applied General Topology},
  year = {2026},
  volume = {27},
  number = {2},
  pages = {25340},
  doi = {10.4995/agt.25340}
}
Kostenlos starten →