Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud data
Not on the map. Why?
Abstract (arXiv)
The manifold Helmholtzian (1-Laplacian) operator Delta1 elegantly generalizes the Laplace-Beltrami operator to vector fields on a manifold mathcal M. In this work, we propose the estimation of the manifold Helmholtzian from point cloud data by a weighted 1-Laplacian mathcal L1. While higher order Laplacians have been introduced and studied, this work is the first to present a graph Helmholtzian constructed from a simplicial complex as a consistent estimator for the continuous operator in a non-parametric setting. Equipped with the geometric and topological information about mathcal M, the Helmholtzian is a useful tool for the analysis of flows and vector fields on mathcal M via the Helmholtz-Hodge theorem. In addition, the mathcal L1 allows the smoothing, prediction, and feature extraction of the flows. We demonstrate these possibilities on substantial sets of synthetic and real point cloud datasets with non-trivial topological structures; and provide theoretical results on the limit of mathcal L1 to Delta1.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 11 of its 48 references that are in the map. First posted on arXiv 13 Mar 2021.
Builds on
11 of 48 references.
References · 11
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2017An introduction to Topological Data Analysis: fundamental and practical aspects for data scientistscited by 171
- 2015A roadmap for the computation of persistent homologycited by 126
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 84
- 2018Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Spacecited by 37
- 2019Graph-based Semi-Supervised & Active Learning for Edge Flowscited by 25
- 2016Two's company, three (or more) is a simplex: Algebraic-topological tools for understanding higher-order structure in neural datacited by 22
- 2014Improved graph Laplacian via geometric self-consistencycited by 5
- 2013Graph Induced Complex on Point Datacited by 3
- 2013Approximate Cech Complexes in Low and High Dimensionscited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 1; 2025: 1; 2026: 1.
7 papers.
- 2023Deciphering Spatio-Temporal Graph Forecasting: A Causal Lens and Treatmentcited by 47
- 2023Hodge-Compositional Edge Gaussian Processescited by 16
- 2021The decomposition of the higher-order homology embedding constructed from the k-Laplaciancited by 8
- 2024Point-Level Topological Representation Learning on Point Cloudscited by 4
- 2025Topological Schr"odinger Bridge Matchingcited by 4
- 2023Multiscale Hodge Scattering Networks for Data Analysiscited by 1
- 2026Topological Signal Processing: An Application-Oriented Tutorialcited by 0
- 2026Topological Signal Processing: An Application-Oriented Tutorial18 May 2026
- 2025Topological Schr"odinger Bridge Matching7 Apr 2025
- 2024Point-Level Topological Representation Learning on Point Clouds4 Jun 2024
- 2023Multiscale Hodge Scattering Networks for Data Analysis17 Nov 2023
- 2023Hodge-Compositional Edge Gaussian Processes30 Oct 2023
- 2023Deciphering Spatio-Temporal Graph Forecasting: A Causal Lens and Treatment23 Sep 2023
- 2021The decomposition of the higher-order homology embedding constructed from the k-Laplacian23 Jul 2021