Related papers: Localization of eigenvectors in random graphs
Inspired by works on the Anderson model on sparse graphs, we devise a method to analyze the localization properties of sparse systems that may be solved using cavity theory. We apply this method to study the properties of the eigenvectors…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
We consider eigenvectors of adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue…
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erd\H{o}s-R\'enyi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the…
We examine the localization properties of the 2D Anderson Hamiltonian with off-diagonal disorder. Investigating the behavior of the participation numbers of eigenstates as well as studying their multifractal properties, we find states in…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are…
Previous literature on random matrix and network science has traditionally employed measures derived from nearest-neighbor level spacing distributions to characterize the eigenvalue statistics of random matrices. This approach, however,…
The spectral properties of the adjacency matrix, in particular its largest eigenvalue and the associated principal eigenvector, dominate many structural and dynamical properties of complex networks. Here we focus on the localization…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
We study the localization properties of the quasiperiodic one-dimensional helical chain with two tunneling paths: nearest-neighbor and a long-range hop that connects sites of consecutive helical turns. Using exact diagonalization, we…
Eigenvector localization refers to the situation when most of the components of an eigenvector are zero or near-zero. This phenomenon has been observed on eigenvectors associated with extremal eigenvalues, and in many of those cases it can…
Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…
We study wave function structure for quantum graphs in the chaotic and disordered regime, using measures such as the wave function intensity distribution and the inverse participation ratio. The result is much less ergodicity than expected…
We analyze gene co-expression network under the random matrix theory framework. The nearest neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral…
Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…
The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the…
Anderson localization on random regular graphs (RRG) serves as a toy-model of many-body localization (MBL). We explore the transition for ergodicity to localization on RRG with large connectivity $m$. In the analytical part, we focus on the…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…
In a tight binding framework, we analyze the characteristics of electronic states in strongly disordered materials (hopping sites are placed randomly with no local order) with tunneling matrix elements decaying exponentially in the atomic…