Steady and ranging sets in graph persistence

DOI10.1007/S41468-022-00099-1MaRDI QIDQ6102901zbMATH OpenOpenAlexFDO

Authors Mattia G. Bergomi, Massimo Ferri, Antonella Tavaglione

Publication date 23 June 2023

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2009.06897

zbMATH Keywords

persistenceweighted digraphweighted graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Persistent homology and applications, topological data analysis (55N31) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce extit{steady} and extit{ranging} sets: two standardized ways of producing persistence diagrams directly from graph-theoretical features. The two constructions are framed in the context of extit{indexing-aware persistence functions}. Furthermore, we introduce a sufficient condition for stability. Finally, we apply the steady- and ranging-based persistence constructions to toy examples and real-world applications.

Recommendations

• Topological graph persistence
• Geometric Approaches to Persistent Homology
• Persistent homology over directed acyclic graphs
• Stability of persistence diagrams
• Stability of persistence diagrams

Cites work

• Bottleneck stability for generalized persistence diagrams
• Categorification of persistent homology
• Cliques and cavities in the human connectome
• Complexes of tournaments, directionality filtrations and persistent homology
• Edit Distance and Persistence Diagrams over Lattices
• Every Monotone Graph Property Is Testable
• Existence of a persistent hub in the convex preferential attachment model
• Generalized persistence diagrams
• Generalized persistence diagrams for persistence modules over posets
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• Natural pseudo-distance and optimal matching between reduced size functions
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• Persistence of hubs in growing random networks
• Persistence theory. From quiver representations to data analysis
• Persistent homology -- a survey
• Persistent path homology of directed networks
• Persistent topology of syntax
• Proximity of persistence modules and their diagrams
• Random networks with sublinear preferential attachment: degree evolutions
• Rank-based persistence
• Size homotopy groups for computation of natural size distances
• Stability of persistence diagrams
• The persistent homotopy type distance
• The theory of the interleaving distance on multidimensional persistence modules
• Theory of interleavings on categories with a flow
• Topological graph persistence

Cited in

(4)

• Reeb graphs: approximation and persistence
• scientific article; zbMATH DE number 1973993 (Why is no real title available?)
• Hierarchies and Ranks for Persistence Pairs
• Stability and extension of steady and ranging persistence

This page was built for publication: Steady and ranging sets in graph persistence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102901)