Related papers: Localization of eigenvectors in random graphs
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
We present a thorough numerical study of the Richardson model with quenched disorder (a fully-connected XX-model with longitudinal random fields). We study the onset of delocalization in typical states (many-body delocalization) and the…
System of Dirac fermions with random-varying mass is studied in detail. We reformulate the system by transfer-matrix formalism. Eigenvalues and wave functions are obtained numerically for various configurations of random telegraphic mass…
We develop a formalism to compute the statistics of the second largest eigenpair of weighted sparse graphs with $N\gg 1$ nodes, finite mean connectivity and bounded maximal degree, in cases where the top eigenpair statistics is known. The…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…
Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts,…
Results of large-scale numerical simulations are reported on the Anderson localization in a two-dimensional square lattice tight-binding model with random flux. Localization lengths, fluctuations of the conductance, and the density of…
Consider an n x n Hermitian random matrix with, above the diagonal, independent entries with alpha-stable symmetric distribution and 0 < alpha < 2. We establish new bounds on the rate of convergence of the empirical spectral distribution of…
In this work we analytically explain the origin of the mobility edge in the partially disordered random regular graphs of degree d, i.e., with a fraction $\beta$ of the sites being disordered, while the rest remain clean. It is shown that…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
Localization phenomena permeate many branches of physics playing a fundamental role on dynamical processes evolving on heterogeneous networks. These localization analyses are frequently grounded, for example, on eigenvectors of adjacency or…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…
We observe a singularity in the electronic properties of the Anderson Model of Localization with bounded diagonal disorder, which is clearly distinct from the well-established mobility edge (localization-delocalization transition) that…
We study the quantum localization phenomena of noninteracting particles in one-dimensional lattices based on tight-binding models with various forms of hopping terms beyond the nearest neighbor, which are generalizations of the famous…
We show that eigenvector centrality exhibits localization phenomena on networks that can be easily partitioned by the removal of a vertex cut set, the most extreme example being networks with a cut vertex. Three distinct types of…
We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured…
Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…