Related papers: A family of diameter-based eigenvalue bounds for q…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…
We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…
We consider the first Robin eigenvalue $\l_p(M,\a)$ for the $p$-Laplacian on a compact Riemannian manifold $M$ with nonempty smooth boundary, with $\a \in \R$ being the Robin parameter. Firstly, we prove eigenvalue comparison theorems of…
We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…
We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…
In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…
We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…
We establish lower bounds for the first non-zero eigenvalue for the natural geometric sub-elliptic Laplacian operator defined on sub-Riemannian manifolds of step 2 that satisfy a positive curvature condition. The methods are very general…
In this work, we obtain the first upper bound on the multiplicity of Laplacian eigenvalues for negatively curved surfaces which is sublinear in the genus g. Our proof relies on a trace argument for the heat kernel, and on the idea of…
We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…
We prove that the Dirichlet eigenvalues of the Laplace-Beltrami operator on a compact Riemannian manifold with cylindrical boundary can be approximated by the spectrum of truncated graph Laplacians constructed from…
In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence, we show that…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
Graphs with few distinct eigenvalues have been investigated extensively. In this paper, we focus on another relevant topic: characterizing graphs with some eigenvalue of large multiplicity. Specifically, the normalized Laplacian matrix of a…
We consider a compact Riemannian manifold M endowed with a potential 1-form A and study the magnetic Laplacian associated with those data (with Neumann magnetic boundary condition if the bpoundary of M is not empty). We first establish a…
With the development of quantum algorithms, high-cost computations are being scrutinized in the hope of a quantum advantage. While graphs offer a convenient framework for multiple real-world problems, their analytics still comes with high…