English
Related papers

Related papers: Root Laplacian Eigenmaps with their application in…

200 papers

We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to…

Data Structures and Algorithms · Computer Science 2010-07-22 Daniel A. Spielman , Shang-Hua Teng

We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…

Spectral Theory · Mathematics 2019-10-21 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

Recently Rohleder proposed a new variational approach to an inequality between the Neumann and Dirichlet eigenvalues in the simply connected planar case using the language of classical vector analysis. Writing his approach in terms of…

Differential Geometry · Mathematics 2025-01-30 Muravyev Mikhail

Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…

Number Theory · Mathematics 2012-02-22 Zubeyir Cinkir

We consider the analytic continuation of the transfer function for a 2x2 matrix Hamiltonian into the unphysical sheets of the energy Riemann surface. We construct non-selfadjoint operators representing operator roots of the transfer…

Mathematical Physics · Physics 2007-05-23 A. K. Motovilov , R. Mennicken

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

Combinatorics · Mathematics 2016-11-21 Olivier Bernardi , Caroline J. Klivans

We introduce the logarithmic analogue of the Laplace-Beltrami operator on Ahlfors regular metric-measure spaces. This operator is intrinsically defined with spectral properties analogous to those of elliptic pseudo-differential operators on…

Functional Analysis · Mathematics 2024-07-12 Dimitris Michail Gerontogiannis , Bram Mesland

Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…

Machine Learning · Statistics 2023-02-07 Edric Tam , David Dunson

It is shown that eigenvalues of Laplace-Beltrami operators on compact Riemannian manifolds can be determined as limits of eigenvalues of certain finite-dimensional operators in spaces of polyharmonic functions with singularities. In…

Functional Analysis · Mathematics 2014-03-21 Isaac Z. Pesenson

A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…

Computational Geometry · Computer Science 2018-05-01 Oshri Halimi , Ron Kimmel

This paper introduces a novel Laplacian matrix aiming to enable the construction of spectral convolutional networks and to extend the signal processing applications for directed graphs. Our proposal is inspired by a Haar-like transformation…

Machine Learning · Computer Science 2025-10-02 Theodor-Adrian Badea , Bogdan Dumitrescu

In this paper, we define a Laplacian operator on a statistical manifold, called the vector Laplacian. This vector Laplacian incorporates information from the Amari-Chentsov tensor. We derive a formula for the vector Laplacian. We also give…

Differential Geometry · Mathematics 2022-02-18 Ruichao Jiang , Javad Tavakoli , Yiqiang Zhao

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

Combinatorics · Mathematics 2014-03-07 Anirban Banerjee

We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…

Spectral Theory · Mathematics 2018-01-08 Colette Anné , Marwa Balti , Nabila Torki-Hamza

Given i.i.d. observations uniformly distributed on a closed submanifold of the Euclidean space, we study higher-order generalizations of graph Laplacians, so-called Hodge Laplacians on graphs, as approximations of the Laplace-Beltrami…

Statistics Theory · Mathematics 2025-04-07 Jan-Paul Lerch , Martin Wahl

As a generalization of slant submersions (Sahin, 2011), semi-slant submersions (Park and Prasad), and slant Riemannian maps (Sahin), we define the notion of semi-slant Riemannian maps from almost Hermitian manifolds to Riemannian manifolds.…

Differential Geometry · Mathematics 2012-09-06 Kwang-Soon Park

This article presents an overview of robot learning and adaptive control applications that can benefit from a joint use of Riemannian geometry and probabilistic representations. The roles of Riemannian manifolds, geodesics and parallel…

Robotics · Computer Science 2020-03-31 Sylvain Calinon

In this paper, we investigate the spectrum of a class of weighted Laplacians on Cayley graphs and determine under what conditions the corresponding eigenspaces are generically irreducible. Specifically, we analyze the spectrum on…

Spectral Theory · Mathematics 2024-06-05 Cristian F. Coletti , Lucas R. de Lima , Diego S. de Oliveira , Marcus A. M. Marrocos

There are very few general theorems on the kernel of the well-known Lichnerowicz Laplacian. In the present article we consider the geometry of the kernel of this operator restricted to covariant (not necessarily symmetric or skew-symmetric)…

Differential Geometry · Mathematics 2019-03-26 Vladimir Rovenski , Sergey Stepanov , Irina Tsyganok

Non-Euclidean constraints are inherent in many kinds of data in computer vision and machine learning, typically as a result of specific invariance requirements that need to be respected during high-level inference. Often, these geometric…

Computer Vision and Pattern Recognition · Computer Science 2017-09-26 Suhas Lohit , Pavan Turaga