Tight basis cycle representatives for persistent homology of large data sets
Manu Aggarwal, Vipul Periwal

TL;DR
This paper introduces efficient algorithms for computing precise, tight boundaries around persistent homology features in large data sets, enabling detailed topological analysis in scientific applications.
Contribution
The authors develop new algorithms for localized, tight representatives of persistent homology features, improving accuracy and computational efficiency for large data analysis.
Findings
Identified unexpected chromatin loops in human genome data.
Detected statistically significant cosmic voids in galaxy distributions.
Attributed topological voids in proteins to biological interactions.
Abstract
Persistent homology (PH) is a popular tool for topological data analysis that has found applications across diverse areas of research. It provides a rigorous method to compute robust topological features in discrete experimental observations that often contain various sources of uncertainties. Although powerful in theory, PH suffers from high computation cost that precludes its application to large data sets. Additionally, most analyses using PH are limited to computing the existence of nontrivial features. Precise localization of these features is not generally attempted because, by definition, localized representations are not unique and because of even higher computation cost. For scientific applications, such a precise location is a sine qua non for determining functional significance. Here, we provide a strategy and algorithms to compute tight representative boundaries around…
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
TopicsTopological and Geometric Data Analysis · Bioinformatics and Genomic Networks
MethodsNetwork On Network
