# Structure of eigenvectors of random regular digraphs

@article{Litvak2019StructureOE,
title={Structure of eigenvectors of random regular digraphs},
author={Alexander E. Litvak and Anna Lytova and Konstantin E. Tikhomirov and Nicole Tomczak-Jaegermann and Pierre Youssef},
journal={Transactions of the American Mathematical Society},
year={2019}
}
• A. Litvak, +2 authors Pierre Youssef
• Published 17 January 2018
• Mathematics
• Transactions of the American Mathematical Society
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 random $d$-regular directed graph on $n$ vertices. In this paper, we study structure of the kernel of submatrices of $M-z\,{\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and… Expand
13 Citations
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.Expand
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*}Expand
Invertibility of adjacency matrices for random d-regular directed graphs
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 randomExpand
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 ^2Expand The rank of random regular digraphs of constant degree • Mathematics, Computer Science • J. Complex. • 2018 It is shown that A_n has rank at least at least n-1 with probability going to one as n goes to infinity. Expand 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},Expand Cokernels of adjacency matrices of random r-regular graphs • Mathematics • 2018 We study the distribution of the cokernels of adjacency matrices (the Smith groups) of certain models of random r-regular graphs and directed graphs, using recent mixing results of M\'esz\'aros. WeExpand Singularity of Bernoulli matrices in the sparse regime pn = O(\log(n)) Consider an n\times n random matrix A_n with i.i.d Bernoulli(p) entries. In a recent result of Litvak-Tikhomirov, they proved the conjecture$$ \mathbb{P}\{\mbox{$A_n$ is singular}\}=(1+o_n(1))Expand
On delocalization of eigenvectors of random non-Hermitian matrices
• Mathematics
• 2018
We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let A be an $$n\times n$$ n × n random matrix with i.i.d real subgaussian entries of zero mean and unitExpand
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
• Mathematics
• 2020
We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ ofExpand