We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Beyond Topological Persistence: Starting from Networks.
- Authors
Bergomi, Mattia G.; Ferri, Massimo; Vertechi, Pietro; Zuffi, Lorenzo
- 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.
- Subjects
COMPUTABLE functions
- Publication
Mathematics (2227-7390), 2021, Vol 9, Issue 23, p3079
- ISSN
2227-7390
- Publication type
Article
- DOI
10.3390/math9233079