Related papers: Flexibility of eigenvalues for graph Laplacians ar…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
We study the effects of a domain deformation to the nodal set of Laplacian eigenfunctions when the eigenvalue is degenerate. In particular, we study deformations of a rectangle that perturb one side and how they change the nodal sets…
We prove the existence of limits of real-analytic Laplace eigenvalue branches for real-analytic families of metrics that degenerate along a compact hypersurface.
For a bounded domain $\Omega$ with a piecewise smooth boundary in an $n$-dimensional Euclidean space $\mathbf{R}^{n}$, we study eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. First we give a general inequality for…
Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We study the approximation of eigenvalues for the Laplace-Beltrami operator on closed Riemannian manifolds in the class $\mathcal{M}$, characterized by bounded Ricci curvature, a lower bound on the injectivity radius, and an upper bound on…
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…
We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular, for the eigenvalue 1, its multiplicity is related to the…
Compact polyhedral surfaces (or, equivalently, compact Riemann surfaces with conformal flat conical metrics) of an arbitrary genus are considered. After giving a short self-contained survey of their basic spectral properties, we study the…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
In this note we correct the proof of Proposition 4 in our paper "The Laplacian Spectrum of Large Graphs Sampled from Graphons" (arXiv:2004.09177) and we improve several results therein. To this end, we prove a new concentration lemma about…
We study the location of the spectrum of the Laplacian on compact metric graphs with complex Robin-type vertex conditions, also known as $\delta$ conditions, on some or all of the graph vertices. We classify the eigenvalue asymptotics as…
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…
In 1980 Yang and Yau~\cite{YY} proved the celebrated upper bound for the first eigenvalue on an orientable surface of genus $\gamma$. Later Li and Yau~\cite{LY} gave a simple proof of this bound by introducing the concept of conformal…
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…
We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…