Related papers: From non-ergodic eigenvectors to local resolvent s…
We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…
Complex networks with directed, local interactions are ubiquitous in nature, and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise…
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 study the eigenvectors of generalized Wigner matrices with subexponential entries and prove that they delocalize at the optimal rate with overwhelming probability. We also prove high probability delocalization bounds with sharp…
Recent work has proposed fading ergodicity as a mechanism for many-body ergodicity breaking. Here, we show that two paradigmatic random matrix ensembles -- the Rosenzweig-Porter model and the ultrametric model -- fall within the same…
We propose a new approach to probing ergodicity and its breakdown in quantum many-body systems based on their response to a local perturbation. We study the distribution of matrix elements of a local operator between the system's…
We consider the bulk eigenvalue statistics of Laplacian matrices of large Erd\H{o}s-R\'enyi random graphs in the regime $p \geq N^{\delta}/N$ for any fixed $\delta >0$. We prove a local law down to the optimal scale $\eta \gtrsim N^{-1}$…
We prove that a very general class of $N\times N$ Hermitian random band matrices is in the delocalized phase when the band width $W$ exceeds the critical threshold, $W\gg \sqrt{N}$. In this regime, we show that, in the bulk spectrum, the…
We review the state of the art on the delocalized non-ergodic regime of the Anderson model on Bethe lattices. We also present new results using Belief Propagation, which consists in solving the self-consistent recursion relations for the…
A one-parameter random matrix model is proposed for describing the statistics of the local amplitudes and phases of electron eigenfunctions in a mesoscopic quantum dot in an arbitrary magnetic field. Comparison of the statistics obtained…
We consider $N\times N$ symmetric random matrices where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove that the eigenvalue spacing statistics in the bulk of the…
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 focus on the many-body eigenstates across a localization-delocalization phase transition. To characterize the robustness of the eigenstates, we introduce the eigenstate overlaps $\mathcal{O}$ with respect to the different boundary…
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…
We consider a general class of symmetric or Hermitian random band matrices $H=(h_{xy})_{x,y \in \llbracket 1,N\rrbracket^d}$ in any dimension $d\ge 1$, where the entries are independent, centered random variables with variances…
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…
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…
Chatterjee (2016) proved, as an application of his general framework relating superconcentration and chaos, that after the entries of an $n \times n$ matrix drawn from the Gaussian unitary ensemble undergo an entrywise Ornstein-Uhlenbeck…
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…
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…