Related papers: Localization for quantum graphs with a random pote…
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…
We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…
We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…
We determine the phase diagram of the Anderson tight-binding model on random regular graphs with Gaussian disorder and sufficiently large degree. In particular, we prove that if the degree is fixed and the number of vertices goes to…
We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
Following the paper exploring the Anderson localization of monochromatically perturbed kicked quantum maps [Phys.Rev. E{\bf 97},012210], the delocalization-localization transition phenomena in polychromatically perturbed quantum maps (QM)…
We investigate spectral and dynamical localization of a quantum system of $ n $ particles on $ \mathbb{R}^d $ which are subject to a random potential and interact through a pair potential which may have infinite range. We establish two…
It is often overlooked that local quantum physics has a built in quantum localization structure which may under certain circumstances disagree with (differential, algebraic) geometric ideas. String theory originated from such a spectacular…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…
We present a factor graph formulation and particle-based sum-product algorithm for robust localization and tracking in multipath-prone environments. The proposed sequential algorithm jointly estimates the mobile agent's position together…
We initiate a systematic study of spectral theory for bounded-degree Borel pmp graphs. Specifically, we study spectral properties of the associated adjacency and Laplacian operators. We start with proving a spectral characterization of…
We derive a counting formula for the eigenvalues of Schr\"odinger operators with self-adjoint boundary conditions on quantum star graphs. More specifically, we develop techniques using Evans functions to reduce full quantum graph eigenvalue…
We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the bulk of the spectrum $[-2\sqrt{d-1}+\varepsilon, 2\sqrt{d-1}-\varepsilon]$ down to the optimal spectral scale, we prove that the Green's…
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…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
We prove spectral and dynamical localization for Anderson models on locally finite graphs using the fractional moment method. Our theorems extend earlier results on localization for the Anderson model on $\ZZ^d$. We establish geometric…