Related papers: Flexibility of eigenvalues for graph Laplacians ar…

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

For any compact riemannian surface of genus three $(\Sigma,ds^2)$ Yang and Yau proved that the product of the first eigenvalue of the Laplacian $\lambda_1(ds^2)$ and the area $Area(ds^2)$ is bounded above by $24\pi$. In this paper we…

We prove that, except in certain low-complexity cases, the automorphism group of the graph of pants decompositions of a nonorientable surface is isomorphic to the mapping class group of that surface.

We study the eigenspace of the Laplacian matrix of a simple graph corresponding to the largest eigenvalue, subsequently arriving at the theory of modular decomposition of T. Gallai.

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

Let $X$ be a compact connected orientable hyperbolic surface and let $X_n$ be a degree $n$ random cover. We show that, with high probability, the distribution of eigenvalues of the Laplacian on $X_n$ converges to the spectral measure of the…

Let $\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\mathcal{G}(n,n-1)=\{K_n\}$. The graphs of $\mathcal{G}(n,n-2)$ are determined by Das,…

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…

Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…

We present a simple algorithm for finding eigenmodes of the Laplacian for arbitrary compact hyperbolic 3-manifolds. We apply our algorithm to a sample of twelve manifolds and generate a list of the lowest eigenvalues. We also display a…

We relate small 1-form Laplacian eigenvalues to relative cycle complexity on closed hyperbolic manifolds: small eigenvalues correspond to closed geodesics no multiple of which bounds a surface of small genus. We describe potential…

We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…

We show in a unified manner that the factorization method describes completely the $L^2$-eigenspaces associated to the discrete part of the spectrum of the twisted Laplacian on constant curvature Riemann surfaces. Subclasses of two variable…

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.…

Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…

The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the…

In this paper, we give a spectral approximation result for the Laplacian on submanifolds of Euclidean spaces with singularities by the $\epsilon$-neighborhood graph constructed from random points on the submanifold. Our convergence rate for…