Related papers: Eigenvalue estimates for the Laplacian on a metric…

We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.

We prove estimates relating exponential or sub-exponential volume growth of weighted graphs to the bottom of the essential spectrum for general graph Laplacians. The volume growth is computed with respect to a metric adapted to the…

A Laplacian matrix is a square matrix whose row sums are zero. We study the limiting eigenvalue distribution of a Laplacian matrix formed by taking a random elliptic matrix and subtracting the diagonal matrix containing its row sums. Under…

We establish an explicit lower bound of the first eigenvalue of the Laplacian on K\"ahler manifolds based off the comparison results of Li and Wang. The lower bound will depend on the diameter, dimension, holomorphic sectional curvature and…

We revisit the well-established regularity estimates on harmonic maps on surfaces to question their independence with respect to the dimension of the target manifold. We are mainly interested in harmonic maps into target ellipsoids, that we…

For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ \pi(G)=\frac{\operatorname{per}(L(G))}{\prod_{v\in V(G)} d(v)}, \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and…

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…

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and…

Spectra of sparse non-Hermitian random matrices determine the dynamics of complex processes on graphs. Eigenvalue outliers in the spectrum are of particular interest, since they determine the stationary state and the stability of dynamical…

The aim of this article is to give a simple geometric condition that guarantees the existence of spectral gaps of the discrete Laplacian on periodic graphs. For proving this, we analyse the discrete magnetic Laplacian (DML) on the finite…

We prove an upper bound on the trace of any 2-positive, trace-preserving map in terms of its smallest eigenvalue. We show that this spectral bound is tight, and that 2-positivity is necessary for this inequality to hold in general.…

Ten sharp lower estimates of the first non-trivial eigenvalue of Laplacian on compact Riemannian manifolds are reviewed and compared. An improved variational formula, a general common estimate, and a new sharp one are added. The best lower…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. In this paper, we present a sharp upper bound for…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…