Vietoris--Rips Shadow for Euclidean Graph Reconstruction
Rafal Komendarczyk, Sushovan Majhi, Atish Mitra

TL;DR
This paper extends the understanding of Euclidean graph reconstruction by analyzing the homotopy and geometric properties of Vietoris--Rips complexes with path-based metrics, providing bounds for accurate topological and geometric recovery.
Contribution
It introduces a family of path-based Vietoris--Rips complexes and establishes quantitative bounds for their shadow projections to recover planar graphs in both homotopy and geometry.
Findings
Shadow projection induces -isomorphism under certain conditions
Provides bounds on sample density and scale for accurate reconstruction
Ensures homotopy-equivalent and Hausdorff-close embeddings of graphs
Abstract
The shadow of an abstract simplicial complex with vertices in is a subset of defined as the union of the convex hulls of simplices of . The Vietoris--Rips complex of a metric space at scale is an abstract simplicial complex whose each -simplex corresponds to points of within diameter . In case and the standard Euclidean metric, the natural shadow projection of the Vietoris--Rips complex is already proved by Chambers et al. to induce isomorphisms on and . We extend the result beyond the standard Euclidean distance on to a family of path-based metrics, . From the pairwise Euclidean distances of points in , we introduce a family (parametrized by ) of path-based Vietoris--Rips complexes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Digital Image Processing Techniques · Topological and Geometric Data Analysis
