Pith. sign in

REVIEW 1 cited by

The circular law for sparse non-Hermitian matrices

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1707.03675 v2 pith:3WFP2RWT submitted 2017-07-12 math.PR

The circular law for sparse non-Hermitian matrices

classification math.PR
keywords randomcircularmatricesprobabilitysparsedeltasqrtvalue
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

For a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered sub-Gaussian random variables of unit variance, and $\{\delta_{i,j}\}$ are i.i.d.~Bernoulli random variables taking value $1$ with probability $p_n$, we prove that the empirical spectral distribution of $A_n/\sqrt{np_n}$ converges weakly to the circular law, in probability, for all $p_n$ such that $p_n=\omega({\log^2n}/{n})$. Additionally if $p_n$ satisfies the inequality $np_n > \exp(c\sqrt{\log n})$ for some constant $c$, then the above convergence is shown to hold almost surely. The key to this is a new bound on the smallest singular value of complex shifts of real valued sparse random matrices. The circular law limit also extends to the adjacency matrix of a directed Erd\H{o}s-R\'{e}nyi graph with edge connectivity probability $p_n$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spectrum of Directed Inhomogeneous Random Graphs

    math.PR 2026-07 conditional novelty 7.0

    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).