Topological graph persistence

DOI10.2478/caim-2020-0005zbMath1479.55011arXiv1707.09670OpenAlexW3111908130MaRDI QIDQ827588

Massimo Ferri, Mattia G. Bergomi, Lorenzo Zuffi

Publication date: 13 January 2021

Published in: Communications in Applied and Industrial Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramseyindependent setcliqueneighborhoodtopological data analysispersistent homologyenclaveless set

Mathematics Subject Classification ID

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

Related Items (5)

Rank-based persistence ⋮ Steady and ranging sets in graph persistence ⋮ A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach ⋮ Introduction ⋮ A simplified algorithm for identifying abnormal changes in dynamic networks

Uses Software

• NetworkX
• Holes
• CliqueTop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Stability of persistence diagrams
• Natural pseudo-distance and optimal matching between reduced size functions
• Extending persistence using Poincaré and Lefschetz duality
• Approximating maximum independent sets by excluding subgraphs
• Convergence of iterated clique graphs
• On the use of size functions for shape analysis
• Cliques and cavities in the human connectome
• Rips filtrations for quasimetric spaces and asymmetric functions with stability results
• A functorial Dowker theorem and persistent homology of asymmetric networks
• The theory of the interleaving distance on multidimensional persistence modules
• Simplicial complexes of graphs
• Aggregation models on hypergraphs
• Homology groups of relations
• Clique topology reveals intrinsic geometric structure in neural correlations
• Persistent homology of complex networks
• Topology and data
• Persistent Path Homology of Directed Networks
• Persistent Homology Lower Bounds on High-Order Network Distances
• Rank-based persistence
• Persistent topological features of dynamical systems
• Collective dynamics of ‘small-world’ networks
• Proximity of persistence modules and their diagrams
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Topological graph persistence