Related papers: Localization of eigenvectors in random graphs
We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
In this work we study the spectral properties of the adjacency matrix of critical Erd\"os-R\'enyi (ER) graphs, i.e. when the average degree is of order \log N. In a series of recent inspiring papers Alt, Ducatez, and Knowles have rigorously…
We compare the spectrum and the localisation properties of the eigenmodes of the Laplacian and the adjacency matrix of 2D random geometric graphs, using numerical diagonalization of these matrices for different system sizes and…
We analyse the eigenvectors of the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$ for $\sqrt{\log N} \ll d \lesssim \log N$. We show the existence of a localized phase, where each eigenvector is exponentially localized…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
Although the spectral properties of random graphs have been a long-standing focus of network theory, the properties of right eigenvectors of directed graphs have so far eluded an exact analytic treatment. We present a general theory for the…
For random L\'evy matrices of size $N \times N$, where matrix elements are drawn with some heavy-tailed distribution $P(H_{ij}) \propto N^{-1} |H_{ij} |^{-1-\mu}$ with $0<\mu<2$ (infinite variance), there exists an extensive number of…
The one-dimensional random trap model with a power-law distribution of mean sojourn times exhibits a phenomenon of dynamical localization in the case where diffusion is anomalous: The probability to find two independent walkers at the same…
Motivated by the problem of Many-Body Localization and the recent numerical results for the level and eigenfunction statistics on the random regular graphs, a generalization of the Rosenzweig-Porter random matrix model is suggested that…
We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
We study spectra and localization properties of Euclidean random matrices. The problem is approximately mapped onto that of a matrix defined on a random graph. We introduce a powerful method to find the density of states and the…
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…
Typical eigenstates of quantum systems, whose classical limit is chaotic, are well approximated as random states. Corresponding eigenvalue spectra is modeled through appropriate ensemble of random matrix theory. However, a small subset of…
Using our previously published algorithm, we analyze the eigenvectors of the generalized Laplacian for two metric graphs occurring in practical applications. As expected, localization of an eigenvector is rare and the network should be…
This work provide a thorough study of L\'evy or heavy-tailed random matrices (LM). By analysing the self-consistent equation on the probability distribution of the diagonal elements of the resolvent we establish the equation determining the…
We study Anderson localisation on high-dimensional graphs with spatial structure induced by long-ranged but distance-dependent hopping. To this end, we introduce a class of models that interpolate between the short-range Anderson model on a…
We study the structural characteristics of complex networks using the representative eigenvectors of the adjacent matrix. The probability distribution function of the components of the representative eigenvectors are proposed to describe…