English

Lower Bounds for Approximating the Vietoris-Rips Filtration

Algebraic Topology 2026-07-07 v1 Computational Geometry Combinatorics

Abstract

The Vietoris-Rips filtration VR()\mathcal{VR}(-) is a standard tool for analyzing the shape of data within topological data analysis. Beginning with seminal work of Sheehy, a substantial amount of research has centered on constructing linear-size sparse approximations to VR()\mathcal{VR}(-) and related filtrations for metric spaces of bounded doubling dimension. We show that this geometric assumption is necessary in a precise sense. Working in the framework of homotopy interleavings, we show that for any fixed c[1,2)c \in [1, \sqrt{2}), there exists a family of finite metric spaces for which any finitely presented cc-approximation to VR()\mathcal{VR}(-) has exponential size. We also show that for any fixed c1c \geq 1, there exists a family of finite metric spaces for which any finitely presented cc-approximation to VR()\mathcal{VR}(-) has superlinear size, yielding an obstruction to linear-size approximations for any fixed approximation factor. Both results extend to the intrinsic \v{C}ech filtration and to any bifiltration containing VR()\mathcal{VR}(-) as a 11-parameter slice, including the function-Rips, degree-Rips, and subdivision-Rips bifiltrations.

Keywords

Cite

@article{arxiv.2607.06524,
  title  = {Lower Bounds for Approximating the Vietoris-Rips Filtration},
  author = {Kenneth McCabe},
  journal= {arXiv preprint arXiv:2607.06524},
  year   = {2026}
}

Comments

15 pages