• Corpus ID: 236318489

The decomposition of the higher-order homology embedding constructed from the k-Laplacian

@inproceedings{Chen2021TheDO,
  title={The decomposition of the higher-order homology embedding constructed from the k-Laplacian},
  author={Yu-Chia Chen and Marina Meilă},
  booktitle={NeurIPS},
  year={2021}
}
The null space of the k-th order Laplacian Lk, known as the 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 L0 has spurred new research and applications, such as spectral clustering algorithms with theoretical guarantees and estimators of the Stochastic Block Model. In… 
View PDF on arXiv
View With Semantic Reader
1 Citations
Background Citations
1

Figures from this paper

One Citation

Citation Type

Citation Type

Dist2Cycle: A Simplicial Neural Network for Homology Localization
TLDR
The proposed model enables learning topological features of the underlying simplicial complexes, specifically, the distance of each k-simplex from the nearest “optimal” kth homology generator, effectively providing an alternative to homology localization.

References

SHOWING 1-10 OF 78 REFERENCES
Consistent manifold representation for topological data analysis
TLDR
It is proved for compact (and conjectured for noncompact) manifolds that CkNN is the unique unweighted construction that yields a geometry consistent with the connected components of the underlying manifold in the limit of large data and conjecture that C kNN is topologically consistent.
Large sample spectral analysis of graph-based multi-manifold clustering
TLDR
This work investigates sufficient conditions that similarity graphs on data sets must satisfy in order for their corresponding graph Laplacians to capture the right geometric information to solve the MMC problem and provides an example of a family of similarity graphs, which are called annular proximity graphs with angle constraints, satisfying these sufficient conditions.
Persistent spectral graph
TLDR
This work introduces persistent spectral theory to create a unified lowdimensional multiscale paradigm for revealing topological persistence and extracting geometric shapes from high-dimensional datasets and finds the proposed method to provide excellent predictions of the protein B-factors for which current popular biophysical models break down.
Approximating loops in a shortest homology basis from point data
TLDR
An algorithm to compute a set of loops from a point data that presumably sample a smooth manifold M ⊂ Rd to approximate a shortest basis of the one dimensional homology group H1(M) over coefficients in finite field Z2.
Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud data
TLDR
This work is the first to present a graph Helmholtzian constructed from a simplicial complex as an estimator for the continuous operator in a nonparametric setting and presents theoretical results on the limit of L1 to ∆1, the first order Laplacian operator of a manifold.
Hodge Laplacians on graphs
TLDR
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph LaPLacian, requiring only knowledge of linear algebra and graph theory.
The geometry of kernelized spectral clustering
TLDR
This work studies the performance of spectral clustering in recovering the latent labels of i.i.d. samples from a finite mixture of nonparametric distributions and controls the fraction of samples mislabeled under finite mixtures with non Parametric components.
An Analysis of the Convergence of Graph Laplacians
TLDR
A kernel-free framework is introduced to analyze graph constructions with shrinking neighborhoods in general and apply it to analyze locally linear embedding (LLE) and how desirable properties such as a convergent spectrum and sparseness can be achieved by choosing the appropriate graph construction.
Topological Signal Processing Over Simplicial Complexes
TLDR
A sampling theory for signals of any order is derived, a method to infer the topology of a simplicial complex from data is proposed and applications to traffic analysis over wireless networks and to the processing of discrete vector fields are illustrated to illustrate the benefits of the proposed methodologies.
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
TLDR
This work proposes a geometrically motivated algorithm for representing the high-dimensional data that provides a computationally efficient approach to nonlinear dimensionality reduction that has locality-preserving properties and a natural connection to clustering.
...
1
2
3
4
5
...