Root Laplacian Eigenmaps with their application in spectral embedding

02/06/2023
by   Shouvik Datta Choudhury, et al.
0

The root laplacian operator or the square root of Laplacian which can be obtained in complete Riemannian manifolds in the Gromov sense has an analog in graph theory as a square root of graph-Laplacian. Some potential applications have been shown in geometric deep learning (spectral clustering) and graph signal processing.

READ FULL TEXT

page 15

page 16

research
01/05/2017

Signed Laplacian for spectral clustering revisited

Classical spectral clustering is based on a spectral decomposition of a ...
research
05/18/2013

Embedding Riemannian Manifolds by the Heat Kernel of the Connection Laplacian

Given a class of closed Riemannian manifolds with prescribed geometric c...
research
02/28/2021

Criminal Networks Analysis in Missing Data scenarios through Graph Distances

Data collected in criminal investigations may suffer from: (i) incomplet...
research
07/07/2016

Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images

Given the prevalence of JPEG compressed images, optimizing image reconst...
research
12/14/2021

Why you should learn functional basis

Efficient and practical representation of geometric data is a ubiquitous...
research
07/23/2021

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

The null space of the k-th order Laplacian ℒ_k, known as the k-th homolo...
research
02/18/2022

Linearization and Identification of Multiple-Attractors Dynamical System through Laplacian Eigenmaps

Dynamical Systems (DS) are fundamental to the modeling and understanding...

Please sign up or login with your details

Forgot password? Click here to reset