Related papers: Eigenvalue ratios of nonnegatively curved graphs
We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\in V$. Clearly, this problem is at least as hard as the usual (non-$st$)…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
In this article, we establish some bounds involving the largest two distance Pareto eigenvalues of a connected graph. Also we characterize all possible values for smallest six distance Pareto eigenvalues of a connected graph.
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
We present a novel method to estimate the dominant eigenvalue and eigenvector pair of any non-negative real matrix via graph infection. The key idea in our technique lies in approximating the solution to the first-order matrix ordinary…
In this paper we analyze the spectral gap of a weighted graph which is the difference between the smallest positive and largest negative eigenvalue of its adjacency matrix. Such a graph can represent e.g. a chemical organic molecule. Our…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
In this paper, we introduce Cheeger type constants via isocapacitary constants introduced by Maz'ya to estimate first Dirichlet, Neumann and Steklov eigenvalues on a finite subgraph of a graph. Moreover, we estimate the bottom of the…
We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
In this paper we prove the semi-circular law for the eigenvalues of regular random graph $G_{n,d}$ in the case $d\rightarrow \infty$, complementing a previous result of McKay for fixed $d$. We also obtain a upper bound on the infinity norm…
We study how eigenvectors of random regular graphs behave when projected onto fixed directions. For a random $d$-regular graph with $N$ vertices, where the degree $d$ grows slowly with $N$, we prove that these projections follow…
The modular graph $C_{a,b,c,d}$ on the torus is a three loop planar graph in which two of the vertices have coordination number four, while the others have coordination number two. We obtain an eigenvalue equation satisfied by $C_{a,b,c,d}$…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…