Related papers: Localization of eigenvectors in random graphs
The phenomenon of Anderson localization of waves in elastic systems is studied. We analyze this phenomenon in two different set of systems: disordered linear chains of harmonic oscillators and disordered rods which oscillate with torsional…
We investigate delocalization phenomena for eigenvectors of real random matrices that are invariant by orthogonal transformations. A specific phenomenon with these ensembles is that an eigenvector is typically more localized when its…
We study the localization property of a two-dimensional noninteracting electron gas in the presence of randomly distributed short-range scatterers. We evaluate the participation number of the eigenstates obtained by exact diagonalization…
We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenvalues of different graph matrices: adjacency, signless…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…
In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels…
We analyse the eigenvectors of the adjacency matrix of a critical Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$, where $d$ is of order $\log N$. We show that its spectrum splits into two phases: a delocalized phase in the middle of the…
We consider some random band matrices with band-width $N^\mu$ whose entries are independent random variables with distribution tail in $x^{-\alpha}$. We consider the largest eigenvalues and the associated eigenvectors and prove the…
We combine numerical diagonalization with a semi-analytical calculations to prove the existence of the intermediate non-ergodic but delocalized phase in the Anderson model on disordered hierarchical lattices. We suggest a new generalized…
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…
We investigate two one-dimensional tight-binding models with disorder that have extended states at zero energy. We use exact and partial diagonalisation of the Hamiltonian to obtain the eigenmodes and the associated participation ratios,…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
Taking into account that a proper description of disordered systems should focus on distribution functions, the authors develop a powerful numerical scheme for the determination of the probability distribution of the local density of states…
Using the supersymmetry method we analytically calculate the local density of states, the localiztion length, the generalized inverse participation ratios, and the distribution function of eigenvector components for the superposition of a…
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…
We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, graphs on $N$ vertices where every edge is chosen independently and with probability $p\equiv p(N)$. We rescale the matrix so that its bulk…
Structured epidemic models can be formulated as first-order hyperbolic PDEs, where the "spatial" variables represent individual traits, called structures. For models with two structures, we propose a numerical technique to approximate…
We show that almost surely the rank of the adjacency matrix of the Erd\"os-R\'enyi random graph $G(n,p)$ equals the number of non-isolated vertices for any $c\ln n/n<p<1/2$, where $c$ is an arbitrary positive constant larger than 1/2. In…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
We perform a thorough and complete analysis of the Anderson localization transition on several models of random graphs with regular and random connectivity. The unprecedented precision and abundance of our exact diagonalization data (both…