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

07/23/2021
by   Yu-Chia Chen, et al.
0

The null space of the k-th order Laplacian ℒ_k, 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 ℒ_0 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 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 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.

READ FULL TEXT

page 9

page 31

research
08/01/2023

Explainable Graph Spectral Clustering of Text Documents

Spectral clustering methods are known for their ability to represent clu...
research
10/27/2015

Spectral Convergence Rate of Graph Laplacian

Laplacian Eigenvectors of the graph constructed from a data set are used...
research
12/31/2022

Exploring Singularities in point clouds with the graph Laplacian: An explicit approach

We develop theory and methods that use the graph Laplacian to analyze th...
research
02/06/2023

Root Laplacian Eigenmaps with their application in spectral embedding

The root laplacian operator or the square root of Laplacian which can be...
research
03/13/2021

Helmholtzian Eigenmap: Topological feature discovery edge flow learning from point cloud data

The manifold Helmholtzian (1-Laplacian) operator Δ_1 elegantly generaliz...
research
01/26/2023

Re-embedding data to strengthen recovery guarantees of clustering

We propose a clustering method that involves chaining four known techniq...
research
01/30/2019

Geometric structure of graph Laplacian embeddings

We analyze the spectral clustering procedure for identifying coarse stru...

Please sign up or login with your details

Forgot password? Click here to reset