For any fixed c ≥ 1, there exist finite metric spaces whose Vietoris-Rips filtration cannot be c-approximated by any finitely presented construction of linear size; for c < √2, exponential size is required.
Barcodes of towers and a streaming algorithm for persistent homology.Discrete & Computational Geometry, 61 (4):852–879, 2019
1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.
1
Pith paper citing it
7
external citations · OpenAlex
fields
math.AT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Lower Bounds for Approximating the Vietoris-Rips Filtration
For any fixed c ≥ 1, there exist finite metric spaces whose Vietoris-Rips filtration cannot be c-approximated by any finitely presented construction of linear size; for c < √2, exponential size is required.