$δ$-core subsampling, strong collapses and TDA

📅 2025-11-25
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
Persistent homology computation on point clouds suffers from high computational complexity and difficulty in simultaneously preserving both global and local topological fidelity. To address this, we propose the δ-core subsampling method—the first to integrate strong collapse theory into topology-aware subsampling. Our approach constructs a minimal core point set satisfying a δ-neighborhood condition, ensuring strong collapse equivalence between the original point cloud and the subsample, thereby provably preserving all persistent homology groups. Integrated with strong-collapse-driven simplicial complex simplification and persistent homology analysis, the method robustly retains salient topological features across multiple scales. Experiments on synthetic and real-world datasets demonstrate that our method achieves an average 12.7% improvement in persistence approximation accuracy over state-of-the-art subsampling strategies, while accelerating computation by 3.2–5.8×.

Technology Category

Search and Optimization: Sampling/Simulation-based SearchMachine Learning: Learning with ManifoldsData Mining & Knowledge Management: Data Compression

Application Category

Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphsWeb Mining and Content Analysis: Robustness and generalizability of Web mining methodsSecurity and Privacy: Data transparency and provenance
📝 Abstract
We introduce a subsampling method for topological data analysis based on strong collapses of simplicial complexes. Given a point cloud and a scale parameter $δ$, we construct a subsampling that preserves both global and local topological features while significantly reducing computational complexity of persistent homology calculations. We illustrate the effectiveness of our approach through experiments on synthetic and real datasets, showing improved persistence approximations compared to other subsampling techniques.
Problem

Research questions and friction points this paper is trying to address.

Develops subsampling method preserving topological features for data analysis
Reduces computational complexity in persistent homology calculations
Improves persistence approximations compared to existing subsampling techniques
Innovation

Methods, ideas, or system contributions that make the work stand out.

Subsampling method using strong collapses
Preserves global and local topological features
Reduces computational complexity of persistent homology
💼 Related Jobs
No related jobs found.
E
Elias Gabriel Minian