Computing bottleneck distance for 2-D interval decomposable modules

DOI10.4230/LIPICS.SOCG.2018.32zbMATH Open1492.55005arXiv1803.02869MaRDI QIDQ5115800FDOQ5115800

Cheng Xin, Tamal K. Dey

Publication date: 18 August 2020

Full work available at URL: https://arxiv.org/abs/1803.02869

Recommendations

• Computing the interleaving distance is NP-hard
• Computational complexity of the interleaving distance
• Topological spaces of persistence modules and their properties
• Exact computation of the matching distance on 2-parameter persistence modules
• The theory of the interleaving distance on multidimensional persistence modules

zbMATH Keywords

interleaving distancebottleneck distancepersistence modules

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31)

Cites Work

• The theory of multidimensional persistence
• The Structure and Stability of Persistence Modules
• Title not available (Why is that?)
• Stability of persistence diagrams
• Decomposition of pointwise finite-dimensional persistence modules
• Categorification of persistent homology
• Betti numbers in multidimensional persistent homology are stable functions
• Computational Complexity of the Interleaving Distance
• Title not available (Why is that?)
• Proximity of persistence modules and their diagrams
• Generalized persistence diagrams
• Categorified Reeb graphs
• On the Krull-Schmidt theorem with application to sheaves
• Computing Decompositions of Modules over Finite-Dimensional Algebras
• Induced Matchings of Barcodes and the Algebraic Stability of Persistence
• The theory of the interleaving distance on multidimensional persistence modules
• A New Approximation Algorithm for the Matching Distance in Multidimensional Persistence
• On the stability of interval decomposable persistence modules
• Decomposition of Graded Modules
• Algebraic stability of zigzag persistence modules
• Geometry Helps to Compare Persistence Diagrams
• The rank invariant stability via interleavings
• Decomposition of exact pfd persistence bimodules
• Title not available (Why is that?)

Cited In (18)

• Computational Complexity of the Interleaving Distance
• Title not available (Why is that?)
• Relative interleavings and applications to sensor networks
• Spatiotemporal persistent homology for dynamic metric spaces
• Elder-Rule-Staircodes for Augmented Metric Spaces
• The theory of the interleaving distance on multidimensional persistence modules
• Title not available (Why is that?)
• Capturing dynamics of time-varying data via topology
• Computing the interleaving distance is NP-hard
• Computing invariants for multipersistence via spectral systems and effective homology
• Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology
• Bigraded Betti numbers and generalized persistence diagrams
• On the stability of interval decomposable persistence modules
• On the geometrical properties of the coherent matching distance in 2D persistent homology
• Generalized persistence algorithm for decomposing multiparameter persistence modules
• On interval decomposability of \(2\)D persistence modules
• Every 1D persistence module is a restriction of some indecomposable 2D persistence module
• Compression for \(2\)-parameter persistent homology

This page was built for publication: Computing bottleneck distance for 2-D interval decomposable modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115800)