2021/12/06 by Abigail Hickok, Hickok, Abigail
Computer Science · #53Z50 (Secondary) #55N31 (Primary) 60B99 #Algebraic Topology (math.AT) #Computational Geometry (cs.CG) #Data Analysis #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Statistics and Probability (physics.data-an) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2112.03334
openalex publication_date 2021/12/06 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
We develop novel methods for using persistent homology to infer the homology of an unknown Riemannian manifold (M, g) from a point cloud sampled from an arbitrary smooth probability density function. Standard distance-based filtered complexes, such as the Čech complex, often have trouble distinguishing noise from features that are simply small. We address this problem by defining a family of "density-scaled filtered complexes" that includes a density-scaled Čech complex and a density-scaled Vietoris--Rips complex. We show that the density-scaled Čech complex is homotopy-equivalent to M for filtration values in an interval whose starting point converges to 0 in probability as the number of points N → ∞ and whose ending point approaches infinity as N → ∞. By contrast, the standard Čech complex may only be homotopy-equivalent to M for a very small range of filtration values. The density-scaled filtered complexes also have the property that they are invariant under conformal transformations, such as scaling. We implement a filtered complex \widehatDVR that approximates the density-scaled Vietoris--Rips complex, and we empirically test the performance of our implementation. As examples, we use \widehatDVR to identify clusters that have different densities, and we apply \widehatDVR to a time-delay embedding of the Lorenz dynamical system. Our implementation is stable (under conditions that are almost surely satisfied) and designed to handle outliers in the point cloud that do not lie on M.