Steady and ranging sets in graph persistence
From MaRDI portal
Publication:6102901
DOI10.1007/s41468-022-00099-1arXiv2009.06897OpenAlexW3086555100MaRDI QIDQ6102901
Antonella Tavaglione, Massimo Ferri, Mattia G. Bergomi
Publication date: 23 June 2023
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.06897
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) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological graph persistence
- Stability of persistence diagrams
- Natural pseudo-distance and optimal matching between reduced size functions
- Random networks with sublinear preferential attachment: degree evolutions
- Size homotopy groups for computation of natural size distances
- Generalized persistence diagrams
- Cliques and cavities in the human connectome
- Persistent topology of syntax
- Persistence of hubs in growing random networks
- Generalized persistence diagrams for persistence modules over posets
- Complexes of tournaments, directionality filtrations and persistent homology
- Categorification of persistent homology
- The persistent homotopy type distance
- The theory of the interleaving distance on multidimensional persistence modules
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Every Monotone Graph Property Is Testable
- Theory of interleavings on categories with a flow
- Persistent Path Homology of Directed Networks
- Edit Distance and Persistence Diagrams over Lattices
- Bottleneck stability for generalized persistence diagrams
- Rank-based persistence
- Proximity of persistence modules and their diagrams
- Existence of a persistent hub in the convex preferential attachment model
This page was built for publication: Steady and ranging sets in graph persistence
