Circular law for the sum of random permutation matrices

@article{Basak2017CircularLF,
title={Circular law for the sum of random permutation matrices},
author={Anirban Basak and Nicholas A. Cook and Ofer Zeitouni},
journal={arXiv: Probability},
year={2017}
}
• Published 25 May 2017
• Mathematics
• arXiv: Probability
Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral distribution of $S_n^d/\sqrt{d}$ converges weakly to the circular law in probability as $n \to \infty$.
26 Citations
The circular law for sparse non-Hermitian matrices
• Mathematics
The Annals of Probability
• 2019
For a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered sub-Gaussian random variables of unit variance, and
Singularity of sparse Bernoulli matrices
• Mathematics
• 2020
Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$,
The sparse circular law under minimal assumptions
• Mathematics
Geometric and Functional Analysis
• 2019
The circular law asserts that the empirical distribution of eigenvalues of appropriately normalized $${n \times n}$$n×n matrix with i.i.d. entries converges to the uniform measure on the unit disc as
The Circular Law for random regular digraphs
• Nicholas A. Cook
• Mathematics
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
• 2019
Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends
Circular law for sparse random regular digraphs
• Mathematics
• 2018
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices.
The smallest singular value of a shifted d-regular random square matrix
• Mathematics
Probability Theory and Related Fields
• 2018
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. Specifically, let C_1<d< c n/\log ^2
Invertibility of adjacency matrices for random d-regular graphs
Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*}
Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices
• Mathematics
• 2020
For a fixed quadratic polynomial $\mathfrak{p}$ in $n$ non-commuting variables, and $n$ independent $N\times N$ complex Ginibre matrices $X_1^N,\dots, X_n^N$, we establish the convergence of the
Structure of eigenvectors of random regular digraphs
• Mathematics
Transactions of the American Mathematical Society
• 2019
Let $n$ be a large integer, let $d$ satisfy $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in {\mathcal C}$. Further, denote by $M$ the adjacency matrix of a
Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
• Mathematics
• 2018
We consider three different models of sparse random graphs:~undirected and directed Erdős-Renyi graphs, and random bipartite graph with an equal number of left and right vertices. For such graphs we