Beyond Topological Persistence: Starting from Networks
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.