Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849)

The authors study the eigenvectors and the eigenvalues of random matrices with i.i.d. entries that have a symmetric distribution. The main results provide a small ball probability bound for the linear combinations of the associated coordinates. They also provide an optimal estimate of the probability that an i.i.d. matrix has simple spectrum. Their techniques establish analogous results for the adjacency matrix of a random directed graph, and as an application, establish some controllability properties of network systems on directed graphs.