Geometry in the space of persistence modules

  title={Geometry in the space of persistence modules},
  author={Vin de Silva and Vidit Nanda},
  booktitle={SoCG '13},
Topological persistence is, by now, an established paradigm for constructing robust topological invariants from point cloud data: the data are converted into a filtered simplicial complex, the complex gives rise to a persistence module, and the module is described by a persistence diagram. In this paper, we study the geometry of the spaces of persistence modules and diagrams, with special attention to Cech and Rips complexes. The metric structures are determined in terms of interleaving maps… 

Figures from this paper

Higher Interpolation and Extension for Persistence Modules
A coherence criterion is isolated which guarantees the extensibility of non-expansive maps into this space of persistence modules across embeddings of the domain to larger ambient metric spaces, allowing Kan extensions to provide the desired extensions.
Induced Matchings of Barcodes and the Algebraic Stability of Persistence
A simple, explicit map sending a morphism f: M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N shows explicitly how a δ-interleaving morphism between two persistence modules induces aδ-matching between thebarcodes of the two modules.
I develop algebraic-topological theories, algorithms and software for the analysis of nonlinear data and complex systems arising in various scientific contexts. In particular, I employ discrete
Topological Methods in Data Analysis
I develop algebraic-topological theories, algorithms and software for the analysis of nonlinear data and complex systems arising in various scientific contexts. In particular, I employ discrete
Induced matchings and the algebraic stability of persistence barcodes
This work shows explicitly how a $\delta$-interleaving morphism between two persistence modules induces a $delta-matching between the barcodes of the two modules, and yields a novel "single-morphism" characterization of the interleaving relation on persistence modules.
Topological Anomaly Detection in Dynamic Multilayer Blockchain Networks
A new topological perspective to structural anomaly detection in dynamic multilayer networks is introduced, and it is demonstrated that the stacked PD approach substantially outperforms state-of-art techniques.


Proximity of persistence modules and their diagrams
This paper presents new stability results that do not suffer from the restrictions of existing stability results, and makes it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence.
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram
Categorification of Persistent Homology
This work redevelops persistent homology (topological persistence) from a categorical point of view and gives a natural construction of a category of ε-interleavings of $\mathbf {(\mathbb {R},\leq)}$-indexed diagrams in some target category and shows that if the target category is abelian, so is this category of interleavments.
Vines and vineyards by updating persistence in linear time
The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering and uses the algorithm to compute 1-parameter families of diagrams which are applied to the study of protein folding trajectories.
Computing persistent homology
The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.
Persistent Homology — a Survey
Persistent homology is an algebraic tool for measuring topological features of shapes and functions. It casts the multi-scale organization we frequently observe in nature into a mathematical
Fast construction of the Vietoris-Rips complex
Probability measures on the space of persistence diagrams
This paper shows that the space of persistence diagrams has properties that allow for the definition of probability measures which support expectations, variances, percentiles and conditional
Zigzag persistent homology in matrix multiplication time
A new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of simplex additions and deletions, which takes O(n3) time in the worst case.
Morse Theory for Filtrations and Efficient Computation of Persistent Homology
An efficient preprocessing algorithm is introduced to reduce the number of cells in a filtered cell complex while preserving its persistent homology groups through an extension of combinatorial Morse theory from complexes to filtrations.