The decomposition of the higher-order homology embedding constructed from the k-Laplacian
Not on the map. Why?
Abstract (arXiv)
The null space of the k-th order Laplacian mathcal Lk, known as the em k-th homology vector space, encodes the non-trivial topology of a manifold or a network. Understanding the structure of the homology embedding can thus disclose geometric or topological information from the data. The study of the null space embedding of the graph Laplacian mathcal L0 has spurred new research and applications, such as spectral clustering algorithms with theoretical guarantees and estimators of the Stochastic Block Model. In this work, we investigate the geometry of the k-th homology embedding and focus on cases reminiscent of spectral clustering. Namely, we analyze the em connected sum of manifolds as a perturbation to the direct sum of their homology embeddings. We propose an algorithm to factorize the homology embedding into subspaces corresponding to a manifold's simplest topological components. The proposed framework is applied to the em shortest homologous loop detection problem, a problem known to be NP-hard in general. Our spectral loop detection algorithm scales better than existing methods and is effective on diverse data such as point clouds and images.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 17 of its 74 references that are in the map. First posted on arXiv 23 Jul 2021.
Builds on
17 of 74 references.
References · 17
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2015A roadmap for the computation of persistent homologycited by 127
- 2019Topological Signal Processing over Simplicial Complexescited by 96
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 86
- 2021Principled Simplicial Neural Networks for Trajectory Predictioncited by 77
- 2019HodgeNet: Graph Neural Networks for Edge Datacited by 39
- 2019Graph-based Semi-Supervised & Active Learning for Edge Flowscited by 25
- 2020Evaluating the Disentanglement of Deep Generative Models through Manifold Topologycited by 20
- 2014Using persistent homology and dynamical distances to analyze protein bindingcited by 15
- 2014The geometry of kernelized spectral clusteringcited by 13
- 2017Volume Optimal Cycle: Tightest representative cycle of a generator on persistent homologycited by 12
- 2019A Notion of Harmonic Clustering in Simplicial Complexescited by 7
5 more
- 2021Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud datacited by 7
- 2018Persistent 1-Cycles: Definition, Computation, and Its Applicationcited by 6
- 2014Improved graph Laplacian via geometric self-consistencycited by 5
- 2019Computing Minimal Persistent Cycles: Polynomial and Hard Casescited by 4
- 2021A class of network models recoverable by spectral clusteringcited by 2
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 2; 2025: 1; 2026: 1.
8 papers.
- 2023Manifold learning: what, how, and whycited by 68
- 2021Dist2Cycle: A Simplicial Neural Network for Homology Localizationcited by 16
- 2023Hodge-Compositional Edge Gaussian Processescited by 16
- 2023Topological Point Cloud Clusteringcited by 5
- 2026Topological Flow Matchingcited by 5
- 2024Point-Level Topological Representation Learning on Point Cloudscited by 4
- 2025Topological Schr"odinger Bridge Matchingcited by 4
- 2024Topological Trajectory Classification and Landmark Inference on Simplicial Complexescited by 1
- 2026Topological Flow Matching14 Jun 2026
- 2025Topological Schr"odinger Bridge Matching7 Apr 2025
- 2024Topological Trajectory Classification and Landmark Inference on Simplicial Complexes4 Dec 2024
- 2024Point-Level Topological Representation Learning on Point Clouds4 Jun 2024
- 2023Manifold learning: what, how, and why7 Nov 2023
- 2023Hodge-Compositional Edge Gaussian Processes30 Oct 2023
- 2023Topological Point Cloud Clustering29 Mar 2023
- 2021Dist2Cycle: A Simplicial Neural Network for Homology Localization28 Oct 2021