Sparse Filtered Nerves
Nello Blaser, Morten Brun

TL;DR
This paper extends Sheehy's sparsification method to general Dowker nerves, enabling efficient approximation of persistent homology for high-dimensional point clouds and filtered spaces.
Contribution
It introduces a novel sparsification approach for filtered Dowker nerves, generalizing previous methods and improving computational efficiency in persistent homology analysis.
Findings
Provides a linear-size filtered simplicial complex approximation
Enables efficient computation of persistent homology in higher dimensions
First approach to sparsification of general Dowker nerves
Abstract
Given a point cloud in Euclidean space and a positive parameter we can consider the -neighborhood of consisting of points at distance less than to . Homology of gives information about components, holes, voids etc. in . The idea of persistent homology is that it may happen that we are interested in some of holes in the spaces that are not detected simultaneously in homology for a single value of , but where each of these holes is detected for in a wide range. When the dimension of the ambient Euclidean space is small, persistent homology is efficiently computed by the -complex. For dimension bigger than three this becomes resource consuming. Don Sheehy discovered that there exists a filtered simplicial complex whose size depends linearly on the cardinality of and whose persistent homology is an approximation of the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Commutative Algebra and Its Applications
