
Stable Signatures for Dynamic Metric Spaces via Zigzag Persistent Homology
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

Persistent Clustering and a Theorem of J. Kleinberg
We construct a framework for studying clustering algorithms, which inclu...
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

Same but Different: distance correlations between topological summaries
Persistent homology allows us to create topological summaries of complex...
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

A derived isometry theorem for constructible sheaves on R
Following Curry and Kashiwara Schapira seminal works on adapting persist...
read it
Stable Signatures for Dynamic Graphs and Dynamic Metric Spaces via Zigzag Persistence
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. In a similar vein, studying the dynamics of social networks leads to the problem of characterizing groups/communities as they form and disperse throughout time. Motivated by this, we study the problem of obtaining persistent homology based summaries of timedependent data. Given a finite dynamic graph (DG), we first construct a zigzag persistence module arising from linearizing the dynamic transitive graph naturally induced from the input DG. Based on standard results, we then obtain a persistence diagram or barcode from this zigzag persistence module. We prove that these barcodes are stable under perturbations in the input DG under a suitable distance between DGs that we identify. More precisely, our stability theorem can be interpreted as providing a lower bound for the distance between DGs. Since it relies on barcodes, and their bottleneck distance, this lower bound can be computed in polynomial time from the DG inputs. Since DGs can be given rise by applying the Rips functor (with a fixed threshold) to dynamic metric spaces, we are also able to derive related stable invariants for these richer class of dynamic objects. Along the way, we propose a summarization of dynamic graphs 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 DGs and the bottleneck distance between their associated barcodes, we exploit recent advances in the stability of zigzag persistence due to Botnan and Lesnick, and to Bjerkevik.
READ FULL TEXT
Comments
There are no comments yet.