English
Related papers

Related papers: Delocalization of eigenvectors of random matrices.…

200 papers

We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson…

Probability · Mathematics 2020-01-13 Paul Jung , Jaehun Lee

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

Probability · Mathematics 2020-01-28 Konstantin Tikhomirov

We prove localization with high probability on sets of size of order $N/\log N$ for the eigenvectors of non-Hermitian finitely banded $N\times N$ Toeplitz matrices $P_N$ subject to small random perturbations, in a very general setting. As…

Spectral Theory · Mathematics 2023-08-02 Anirban Basak , Martin Vogel , Ofer Zeitouni

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…

Probability · Mathematics 2012-10-15 Ioana Dumitriu , Soumik Pal

We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…

Probability · Mathematics 2015-06-05 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

Probability · Mathematics 2024-04-22 Mohammed Osman

We consider $N\times N$ symmetric or hermitian random matrices with independent, identically distributed entries where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove…

Mathematical Physics · Physics 2017-08-23 Laszlo Erdos

The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show this convergence on all mesoscopic scales slightly…

Probability · Mathematics 2021-02-08 Johannes Alt , Torben Krüger

We consider Hermitian and symmetric random band matrices $H = (h_{xy})$ in $d \geq 1$ dimensions. The matrix entries $h_{xy}$, indexed by $x,y \in (\bZ/L\bZ)^d$, are independent, centred random variables with variances $s_{xy} = \E…

Probability · Mathematics 2015-06-05 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

Consider a real diagonal deterministic matrix $X_n$ of size $n$ with spectral measure converging to a compactly supported probability measure. We perturb this matrix by adding a random finite rank matrix, with delocalized eigenvectors. We…

Probability · Mathematics 2011-06-21 Florent Benaych-Georges , Alice Guionnet , Mylène Maïda

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…

Discrete Mathematics · Computer Science 2011-09-08 Mihai Cucuringu , Michael W. Mahoney

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}$…

Probability · Mathematics 2015-10-22 Jiaoyang Huang , Benjamin Landon

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

Dynamical Systems · Mathematics 2009-12-17 Shimon Brooks , Elon Lindenstrauss

We study the spectral properties of a class of random matrices where the matrix elements depend exponentially on the distance between uniformly and randomly distributed points. This model arises naturally in various physical contexts, such…

Disordered Systems and Neural Networks · Physics 2015-05-18 Ariel Amir , Yuval Oreg , Yoseph Imry

This paper studies the delocalized regime of an ultrametric random operator whose independent entries have variances decaying in a suitable hierarchical metric on $\mathbb{N}$. When the decay-rate of the off-diagonal variances is…

Mathematical Physics · Physics 2019-08-28 Per von Soosten , Simone Warzel

We study large $N\times N$ power-law random band matrices $H=(H_{ij})$ with centered complex Gaussian entries, where the variances satisfy a power-law decay $\mathbb{E}|H_{ij}|^2\propto (|i-j|/W+1)^{-1-\alpha}$, for some exponent…

Probability · Mathematics 2026-04-15 Jiaqi Fan , Fan Yang , Jun Yin

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being independent identically distributed random variables with mean zero and unit variance. We additionally suppose that $\mathbb E…

Probability · Mathematics 2016-12-01 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

We present a novel block reduction method for the study of a general class of random band matrices (RBM) defined on the $d$-dimensional lattice $\mathbb{Z}_{L}^d:=\{1,2,\ldots,L\}^{d}$ for $d\in \{1,2\}$, with band width $W$ and an almost…

Probability · Mathematics 2025-12-23 Jiaqi Fan , Fan Yang , Jun Yin

We show that for an Erd\H{o}s-R\'{e}nyi graph on $N$ vertices with expected degree $d$ satisfying $\log^{-1/9}N\leq d\leq \log^{1/40}N$, the largest eigenvalues can be precisely determined by small neighborhoods around vertices of close to…

Probability · Mathematics 2023-09-21 Ella Hiesmayr , Theo McKenzie

In the case of graph partitioning, the emergence of localized eigenvectors can cause the standard spectral method to fail. To overcome this problem, the spectral method using a non-backtracking matrix was proposed. Based on numerical…

Social and Information Networks · Computer Science 2016-03-18 Tatsuro Kawamoto