Eigenvectors and controllability of non-Hermitian random matrices and directed graphs

From MaRDI portal
Publication:2042849

DOI10.1214/21-EJP588zbMATH Open1470.15033arXiv2004.10543OpenAlexW3158567170MaRDI QIDQ2042849FDOQ2042849


Authors: Kyle Luh, Sean O'Rourke Edit this on Wikidata


Publication date: 21 July 2021

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: 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 mathbfv of N our main results provide a small ball probability bound for linear combinations of the coordinates of mathbfv. Our results generalize the works of Meehan and Nguyen as well as Touri and the second author for random symmetric matrices. Along the way, we provide an optimal estimate of the probability that an iid matrix has simple spectrum, improving a recent result of Ge. Our techniques also allow us to establish analogous results for the adjacency matrix of a random directed graph, and as an application we establish controllability properties of network control systems on directed graphs.


Full work available at URL: https://arxiv.org/abs/2004.10543




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Eigenvectors and controllability of non-Hermitian random matrices and directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2042849)