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).
Circular law for the sum of random permutation matrices
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Under sparse heterogeneous random noise, eigenspace perturbation bounds are derived via QVE and isotropic local laws that explicitly separate a structured geometric bias term from signal-to-noise and fluctuation contributions.
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).
-
Geometric bias in eigenspace perturbation under random heterogeneous noise
Under sparse heterogeneous random noise, eigenspace perturbation bounds are derived via QVE and isotropic local laws that explicitly separate a structured geometric bias term from signal-to-noise and fluctuation contributions.