Related papers: Circular law for sparse random regular digraphs

We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the…

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

The circular law asserts that the spectral measure of eigenvalues of rescaled random matrices without symmetry assumption converges to the uniform measure on the unit disk. We prove a local version of this law at any point $z$ away from the…

We explore the validity of the circular law for random matrices with non i.i.d. entries. Let A be a random n \times n real matrix having as a random vector in R^{n^2} a log-concave isotropic unconditional law. In particular, the entries are…

Let $X$ be a matrix sampled uniformly from the set of doubly stochastic matrices of size $n\times n$. We show that the empirical spectral distribution of the normalized matrix $\sqrt{n}(X-{\mathbf {E}}X)$ converges almost surely to the…

We show that, under some general assumptions on the entries of a random complex $n \times n$ matrix $X_n$, the empirical spectral distribution of $\frac{1}{\sqrt{n}} X_n$ converges to the uniform law of an ellipsoid as $n$ tends to…

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

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…

Let $A$ be the adjacency matrix of a uniformly random $d$-regular digraph on $n$ vertices, and suppose that $\min(d,n-d)\geq\lambda n$. We show that for any $\kappa \geq 0$, \[\mathbb{P}[s_n(A)\leq\kappa]\leq…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

We study the limiting spectral distribution of the normalized Laplacian $\mathcal L$ of an Erd\H{o}s-R\'enyi graph $G(n,p)$. To account for the presence of isolated vertices in the sparse regime, we define $\mathcal L$ using the…

Consider the empirical spectral distribution of complex random $n\times n$ matrix whose entries are independent and identically distributed random variables with mean zero and variance $1/n$. In this paper, via applying potential theory in…

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

We prove that the empirical spectral distribution of a (d_L, d_R)-biregular, bipartite random graph, under certain conditions, converges to a symmetrization of the Mar\v{c}enko-Pastur distribution of random matrix theory. This convergence…

In this paper we describe a strategy to study the Anderson model of an electron in a random potential at weak coupling by a renormalization group analysis. There is an interesting technical analogy between this problem and the theory of…