Lower Bounds for Approximating the Vietoris-Rips Filtration
Abstract
The Vietoris-Rips filtration 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 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 , there exists a family of finite metric spaces for which any finitely presented -approximation to has exponential size. We also show that for any fixed , there exists a family of finite metric spaces for which any finitely presented -approximation to 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 as a -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