Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and digraphs. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness—clique communities, k-vertex, and k-edge connectedness—directly on simple graphs and strong connectedness in digraphs.
Beyond Topological Persistence: Starting from Networks / Bergomi, Mattia G.; Ferri, Massimo; Vertechi, Pietro; Zuffi, Lorenzo. - In: MATHEMATICS. - ISSN 2227-7390. - ELETTRONICO. - 9:23(2021), pp. 3079-3079. [10.3390/math9233079]
Beyond Topological Persistence: Starting from Networks
Bergomi, Mattia G.;Ferri, Massimo
;
2021
Abstract
Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and digraphs. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness—clique communities, k-vertex, and k-edge connectedness—directly on simple graphs and strong connectedness in digraphs.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
