arXiv · 1801.06725
A Comparison Framework for Interleaved Persistence Modules
Abstract
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show how the generalized algebraic stability theorem enables the computation of rigorous error bounds in the space of persistence diagrams that go beyond the typical formulation in terms of bottleneck (or log bottleneck) distance.
Explore related subjects
Keep this discovery
Shaun Harker, Miroslav Kramar, Rachel Levanger, Konstantin Mischaikow. 2018-01-20. A Comparison Framework for Interleaved Persistence Modules. https://arxiv.org/abs/1801.06725
Cite the original work for its findings. Save a collection to share your selection of sources.