Related papers: Root Laplacian Eigenmaps with their application in…
Riemannian geometry provides the fundamental framework for optimization on nonlinear spaces such as matrix manifolds, which arise in machine learning, signal processing, and robotics. While the underlying theory is classical, existing…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional spaces and match…
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general…
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…
The rotational dimension is a minor monotone graph invariant related to the dimension of an Euclidean space containing a spectral embedding corresponding to the first nonzero eigenvalue of the graph Laplacian, which is introduced by…
We give a formula relating the $L^2$-isoperimetric profile to the spectral distribution of the Laplace operator associated to a finitely generated group $\Gamma$ or a Riemannian manifold with a cocompact, isometric $\Gamma$-action. As a…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
Spectral geometric methods have brought revolutionary changes to the field of geometry processing. Of particular interest is the study of the Laplacian spectrum as a compact, isometry and permutation-invariant representation of a shape.…
Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…
For a compact, connected metric graphs with a boundary that consists of $k$ vertices, we prove that an arbitrary symmetric $k\times k$ matrix with real entries can be realized as the Dirichlet-to-Neumann operator for the Laplacian plus a…
Let $x : M \to E^m$ be an isometric immersion of a Riemannian manifold $M$ into a Euclidean $m$-space. Denote by $\Delta$ the Laplace operator of $M$. Then $\Delta$ gives rise to a differentiable map $L :M \to E^m$, called the Laplace map,…
We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…
We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
Negative-index metamaterials possess a negative refractive index and thus present an interesting substance for designing uncommon optical effects such as invisibility cloaking. This paper deals with operators encountered in an…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
In this article, we illustrate and draw connections between the geometry of zero sets of eigenfunctions, graph theory and the vanishing order of eigenfunctions. We identify the nodal set of an eigenfunction of the Laplacian (with smooth…
Numerical integration and function approximation on compact Riemannian manifolds based on eigenfunctions of the Laplace-Beltrami operator have been widely studied in the recent literature. The standard example in numerical experiments is…