Related papers: Improved graph Laplacian via geometric self-consis…
We propose a kernel regression method to predict a target signal lying over a graph when an input observation is given. The input and the output could be two different physical quantities. In particular, the input may not be a graph signal…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
Kernel estimation techniques, such as mean shift, suffer from one major drawback: the kernel bandwidth selection. The bandwidth can be fixed for all the data set or can vary at each points. Automatic bandwidth selection becomes a real…
Graphs are ubiquitous, and learning on graphs has become a cornerstone in artificial intelligence and data mining communities. Unlike pixel grids in images or sequential structures in language, graphs exhibit a typical non-Euclidean…
The aim of this paper is to propose a novel framework to infer the sheaf Laplacian, including the topology of a graph and the restriction maps, from a set of data observed over the nodes of a graph. The proposed method is based on sheaf…
Practical applications of kernel methods often use variable bandwidth kernels, also known as self-tuning kernels, however much of the current theory of kernel based techniques is only applicable to fixed bandwidth kernels. In this paper, we…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
We present LaplaceGNN, a novel self-supervised graph learning framework that bypasses the need for negative sampling by leveraging spectral bootstrapping techniques. Our method integrates Laplacian-based signals into the learning process,…
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)…
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to…
Connection graphs (CGs) extend traditional graph models by coupling network topology with orthogonal transformations, enabling the representation of global geometric consistency. They play a key role in applications such as synchronization,…
Assume that $M$ is a compact Riemannian manifold of bounded geometry given by restrictions on its diameter, Ricci curvature and injectivity radius. Assume we are given, with some error, the first eigenvalues of the Laplacian $\Delta_g$ on…
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…
We use heat kernels or eigenfunctions of the Laplacian to construct local coordinates on large classes of Euclidean domains and Riemannian manifolds (not necessarily smooth, e.g. with $\mathcal{C}^\alpha$ metric). These coordinates are…
The eigenfunctions of the Laplace-Beltrami operator have widespread applications in a number of disciplines of engineering, computer vision/graphics, machine learning, etc. These eigenfunctions or manifold harmonics, provide the means to…
We consider the Laplace-Beltrami operator in tubular neighbourhoods of curves on two-dimensional Riemannian manifolds, subject to non-Hermitian parity and time preserving boundary conditions. We are interested in the interplay between the…
With the rapid expansion of applied 3D computational vision, shape descriptors have become increasingly important for a wide variety of applications and objects from molecules to planets. Appropriate shape descriptors are critical for…
We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
We analyze the spectral clustering procedure for identifying coarse structure in a data set $x_1, \dots, x_n$, and in particular study the geometry of graph Laplacian embeddings which form the basis for spectral clustering algorithms. More…
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…