DeepAI AI Chat
Log In Sign Up

Edit Distance and Persistence Diagrams Over Lattices

by   Alexander McCleary, et al.

We build a functorial pipeline for persistent homology. The input to this pipeline is a filtered simplicial complex indexed by any finite lattice, and the output is a persistence diagram defined as the Möbius inversion of a certain monotone integral function. We adapt the Reeb graph edit distance of Landi et. al. to each of our categories and prove that both functors in our pipeline are 1-Lipschitz making our pipeline stable.


page 1

page 2

page 3

page 4


Universality of the Bottleneck Distance for Extended Persistence Diagrams

The extended persistence diagram is an invariant of piecewise linear fun...

Approximation algorithms for 1-Wasserstein distance between persistence diagrams

Recent years have witnessed a tremendous growth using topological summar...

On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spaces

Persistence diagrams are important descriptors in Topological Data Analy...

On the Metric Distortion of Embedding Persistence Diagrams into Reproducing Kernel Hilbert Spaces

Persistence diagrams are important feature descriptors in Topological Da...

Graph Similarity Using PageRank and Persistent Homology

The PageRank of a graph is a scalar function defined on the node set of ...

A Lattice-Theoretic Perspective on the Persistence Map

We provide a naturally isomorphic description of the persistence map fro...

Topological Echoes of Primordial Physics in the Universe at Large Scales

We present a pipeline for characterizing and constraining initial condit...