The spectrum of directed inhomogeneous random graphs follows a non-homogeneous circular law, with finite-rank outliers exhibiting explicit Gaussian fluctuations at scale sqrt(s_n/n).
Critical Erd{\H o}s-R\'enyi digraph: all eigenvectors away from zero are delocalized
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We consider the adjacency matrix of the directed Erd{\H o}s-R\'enyi graph. As long as the expected degree is larger than the logarithm of the number of vertices, the graph is connected, we show that all eigenvectors are completely delocalized. Below this critical scale, we prove eigenvector delocalization if the corresponding eigenvalue is away from zero. This contrasts the \emph{undirected} or Hermitian setting, where large eigenvalues have localized eigenvectors [arXiv:2005.14180]. Our results also hold for sparse random matrices with independent entries, which can be viewed as weighted Erd{\H o}s-R\'enyi digraphs.
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Spectrum of Directed Inhomogeneous Random Graphs
The spectrum of directed inhomogeneous random graphs follows a non-homogeneous circular law, with finite-rank outliers exhibiting explicit Gaussian fluctuations at scale sqrt(s_n/n).