
Stable Signatures for Dynamic Graphs and Dynamic Metric Spaces via Zigzag Persistence
When studying flocking/swarming behaviors in animals one is interested i...
read it

Stable Persistent Homology Features of Dynamic Metric Spaces
Characterizing the dynamics of timeevolving data within the framework o...
read it

On the geometrical properties of the coherent matching distance in 2D persistent homology
In this paper we study a new metric for comparing Betti numbers function...
read it

The Generalized Persistent Nerve Theorem
In this paper a parameterized generalization of a good cover filtration ...
read it

Same but Different: distance correlations between topological summaries
Persistent homology allows us to create topological summaries of complex...
read it

Distances and Isomorphism between Networks and the Stability of Network Invariants
We develop the theoretical foundations of a network distance that has re...
read it

Graph Similarity Using PageRank and Persistent Homology
The PageRank of a graph is a scalar function defined on the node set of ...
read it
Stable Signatures for Dynamic Metric Spaces via Zigzag Persistent Homology
When studying flocking/swarming behaviors in animals one is interested in quantifying and comparing the dynamics of the clustering induced by the coalescence and disbanding of animals in different groups. Motivated by this, we study the problem of obtaining persistent homology based summaries of timedependent metric data. Given a finite dynamic metric space (DMS), we construct the zigzag simplicial filtration arising from applying the Rips simplicial complex construction (with a fixed scale parameter) to this finite DMS. Upon passing to 0th homology with field coefficients, we obtain a zigzag persistence module and, based on standard results, we in turn obtain a persistence diagram or barcode from this zigzag persistence module. We prove that these barcodes are stable under perturbations in the input DMS. In order to formalize the notion of perturbation we introduce a suitable distance between DMSs and we then prove that the value of this distance between any two DMSs admits as a lower bound the bottleneck distance between the Rips barcodes associated to each of two input DMSs. This lower bound can be computed in polynomial time from the DMS inputs. Along the way, we propose a summarization of dynamic metric spaces that captures their timedependent clustering features which we call formigrams. These setvalued functions generalize the notion of dendrogram, a prevalent tool for hierarchical clustering. In order to elucidate the relationship between our distance between two dynamic metric spaces and the bottleneck distance between their Rips zigzag barcodes, we exploit recent advances in the stability of zigzag persistence (due to Botnan and Lesnick). By providing explicit constructions, we prove that for each integer k≥ 1 there exist pairs of DMSs at finite interleaving distance whose kth persistent homology barcodes are at infinite barcode distance.
READ FULL TEXT
Comments
There are no comments yet.