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

Given a graph Laplacian with positively and negatively weighted edges we are interested in characterizing the set of weights that give a particular spectral index, i.e.~give a prescribed number of positive, zero, and negative eigenvalues.…

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…

A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…

On a compact Riemannian manifold $M$ with boundary, we give an estimate for the eigenvalues $(\lambda\_k(\tau,\alpha))\_k$ of the magnetic Laplacian with the Robin boundary conditions. Here, $\tau$ is a positive number that defines the…

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 consider a metric graph consisting of two edges, one of which has length $\varepsilon$ which we send to zero. On this graph we study the resolvent and spectrum of the Laplacian subject to a general vertex condition at the connecting…

A mixed tree is a tree in which both directed arcs and undirected edges may exist. Let $T$ be a mixed tree with $n$ vertices and $m$ arcs, where an undirected edge is counted twice as arcs. Let $A$ be the adjacency matrix of $T$. For…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…

We obtain upper estimates for the bottom (that is, greatest lower bound) of the essential spectrum of weighted Laplacian operator of a weighted manifold under assumptions of the volume growth of their geodesic balls and spheres.…

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…

Let $M$ be a closed differentiable manifold of dimension at least $3$. Let $\Lambda_0 (M)$ be the minimun number of non-positive eigenvalues that the conformal Laplacian of a metric on $M$ can have. We prove that for any $k$ greater than or…

For $0\le \alpha\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix.…

Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…

In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected…

The normalized distance Laplacian of a graph $G$ is defined as $\mathcal{D}^\mathcal{L}(G)=T(G)^{-1/2}(T(G)-\mathcal{D}(G))T(G)^{-1/2}$ where $\mathcal{D}(G)$ is the matrix with pairwise distances between vertices and $T(G)$ is the diagonal…

This paper focuses on the concentration properties of the spectral norm of the normalized Laplacian matrix for Erd\H{o}s-R\'enyi random graphs. First, We achieve the optimal bound that can be attained in the further question posed by Le et…

Given a rooted tree $T$ with vertices $u_1,u_2,\ldots,u_n$, the level matrix $L(T)$ of $T$ is the $n \times n$ matrix for which the $(i,j)$-th entry is the absolute difference of the distances from the root to $v_i$ and $v_j$. This matrix…

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…

We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.