CoChat

The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index; 5 of the 5 sources its claims cite were checked for support.

Local law and Tracy–Widom limit for sparse random matrices

Open access
Lee, Ji Oon, Schnelli, Kevin · 2018 · Probability Theory and Related Fields

Overview

CoChat Summary

TL;DR

The paper proves a local law up to the spectral edges for sparse random matrices and shows GOE Tracy–Widom fluctuations for the rescaled extremal eigenvalues once a deterministic sparsity-induced edge shift is included. For Erdős–Rényi adjacency matrices this gives Tracy–Widom fluctuations of the second largest eigenvalue for \(p \gg N^{-2/3}\) with a deterministic shift of order \((Np)^{-1}\).

Key findings

  • Under Assumption 2.3 with \(N^\phi \le q \le N^{1/2}\), the normalized Green-function trace satisfies \(|m_H(z)-\tilde m(z)| \prec 1/q^2 + 1/(N\eta)\) uniformly on \(E\), where \(\tilde m\) solves \(1+z\tilde m+\tilde m^2+\frac{s^{(4)}}{q^2}\tilde m^4=0\) and is the Stieltjes transform of a deterministic symmetric measure \(\tilde\rho\) with support \([-L,L]\). The corresponding density estimate is \(|n(E_1,E_2)-n_{\tilde\rho}(E_1,E_2)| \prec \frac{E_2-E_1}{q^2}+\frac1N\).
  • The edge location satisfies \(L=2+\frac{s^{(4)}}{q^2}+O(q^{-4})\), and the operator norm obeys \(|\,\|H\|-L\,| \prec 1/q^4+1/N^{2/3}\).
  • If \(\phi>1/6\), i.e. \(q\gg N^{1/6}\), then \(\lim_{N\to\infty}\mathbb P(N^{2/3}(\lambda_1^H-L)\le s)=F_1(s)\), the GOE Tracy–Widom law. For the Erdős–Rényi adjacency matrix with \(p\gg N^{-2/3}\), the second largest eigenvalue satisfies \(\lim_{N\to\infty}\mathbb P(N^{2/3}(\lambda_2^A-L-a)\le s)=F_1(s)\), with \(L=2+d^{-1}+O(d^{-2})\), \(d=pN\), and shift \(a=\frac{q}{N}(1-q^2/N)^{-1/2}\).
  • The Tracy–Widom result extends to joint distributions of the first \(k\) rescaled extreme eigenvalues, matching the GOE.

Methods

  • The model is a real symmetric \(N\times N\) sparse random matrix with zero diagonal, independent off-diagonal entries, moment conditions \(\mathbb E H_{ij}=0\), \(\mathbb E H_{ij}^2=(1-\delta_{ij})/N\), and \(\mathbb E|H_{ij}|^k\le (Ck)^{ck}/(Nq^{k-2})\) for \(k\ge3\), with sparsity parameter \(N^\phi\le q\le N^{1/2}\). This includes centered Erdős–Rényi adjacency matrices and diluted Wigner matrices.
  • The local law is proved via a new recursive moment estimate for the normalized trace \(m\) of the Green function, controlling high moments recursively using cumulant expansions rather than fully expanding all powers.
  • The edge universality proof uses the Green function comparison method with a continuous flow interpolating between the sparse random matrix and the GOE, estimating the rate of change of \(m\) along the flow and offsetting it by the edge shift.

Limitations

  • The paper restricts the sparsity parameter to \(N^\phi\le q\le N^{1/2}\) for arbitrarily small \(\phi>0\), though it expects the method can cover \((\log N)^{A_0\log\log N}\le q\le N^{1/2}\), \(A_0\ge30\), as considered in prior work.
  • Edge universality requires \(\phi>1/6\); the paper expects the exponent \(1/6\) to be critical. For \(q\ll N^{1/6}\), bulk eigenvalue fluctuations are larger than \(N^{-2/3}\) and are expected to affect edge fluctuations, so the Tracy–Widom limit is not expected to hold. For Erdős–Rényi graphs, if \(p\ll N^{-2/3}\), an edge-universality-based test may fail.
  • The assumption of zero diagonal entries is stated to be easily dropped. Evident from the provided text: the excerpt is truncated after Section 3, so the detailed proofs in Sections 4–7 are not available here for verification.

Model-written summary of a shortened version of the paper’s full text (it is longer than we read). Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1007/s00440-017-0787-8

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

4 Valid · 1 Not valid · 0 Not checked · 7 Own results and interpretations

7 more claims

Create a free account to see all 12 claims and every source verdict.

See all claims — free account

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 43 references

Research works printed but not linked: 1

  1. Erdős, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–61 (1960)

Cited by

See all 98

Metadata

Authors
Lee, J. O., & Schnelli, K.
Affiliations
  • Korea Advanced Institute of Science and Technology (KR)
  • Institute of Science and Technology Austria (AT)
Corresponding author
Lee, Ji Oon
Venue
Probability Theory and Related Fields
Published
2017-06-14
Volume
171
Issue
1-2
Pages
543-616
ISSN
  • 0178-8051 (ISSN-L)
  • 1432-2064
OpenAlex
W2406111469
Cited by
87
References
43
Citations by year
2026: 6 · 2025: 11 · 2024: 11 · 2023: 10 · 2022: 9 · 2021: 9 · 2020: 17 · 2019: 9 · 2018: 1 · 2017: 4
FWCI
5.90
Type
journal article
Language
en
Open access
Locations
  • Probability Theory and Related Fields (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Samsung Science and Technology Foundation (SSTF-BA1402-04)
  • ERC Advanced Grant (RANMAT No. 338804)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Random Matrices and Applications
  • Physical Sciences › Mathematics › Mathematical Physics › Spectral Theory in Mathematical Physics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Quantum chaos and dynamical systems
Keywords
sparse random matrices, local legislation, Tracy-Widom distribution, edge universality, Erdős-Rényi random graphs, adjacency matrix, eigenvalue density, extreme eigenvalues, second largest eigenvalue

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Local law and Tracy–Widom limit for sparse random matrices. https://app.cochat.ai/papers/10.1007/s00440-017-0787-8
The paper
Lee, J. O., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. https://doi.org/10.1007/s00440-017-0787-8

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.