Related papers: On Agmon metrics and exponential localization for …
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
In this paper we continue our study of the Laplacian on manifolds with axial analytic asymptotically cylindrical ends initiated in~arXiv:1003.2538. By using the complex scaling method and the Phragm\'{e}n-Lindel\"{o}f principle we prove…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We derive the limiting distribution for the largest eigenvalues of the adjacency matrix for a stochastic blockmodel graph when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…
The smallest eigenvalues of (distance-j) Hamming graphs with distance parameter j at least half the length were completely determined by Brouwer et al. (2018). In the present work, we address the complementary regime, namely distances j…
We give a concise presentation of the construction of the Liouville quantum gravity (LQG) eigenvalues and eigenfunctions, i.e., the spectrum associated to the infinitesimal generator of Liouville Brownian motion, the canonical diffusion in…
We study ratios of eigenvalues of the Laplacian on compact metric graphs. Our goals are threefold: First, we prove a sharp Ashbaugh--Benguria-type bound for the ratio of the first two eigenvalues on compact trees with Dirichlet conditions…
We derive eigenvalue bounds for the $t$-distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs, providing alternative spectral proofs for results by Ngo,…
We introduce a class of L\'{e}vy processes subject to specific regularity conditions, and consider their Feynman-Kac semigroups given under a Kato-class potential. Using new techniques, first we analyze the rate of decay of eigenfunctions…
We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…
We study the computational complexity of the eigenvalue problem for the Klein-Gordon equation in the framework of the Solvability Complexity Index Hierarchy. We prove that the eigenvalue of the Klein-Gordon equation with linearly decaying…
We develop a Logvinenko--Sereda theory for one-dimensional vector-valued self-adjoint operators. We thus deliver upper bounds on $L^2$-norms of eigenfunctions -- and linear combinations thereof -- in terms of their $L^2$- and…
In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of…
We consider the adjacency matrix $A$ of a large random graph and study fluctuations of the function $f_n(z,u)=\frac{1}{n}\sum_{k=1}^n\exp\{-uG_{kk}(z)\}$ with $G(z)=(z-iA)^{-1}$. We prove that the moments of fluctuations normalized by…