Pith. sign in

REVIEW 4 major objections 3 minor 1 cited by

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants

T0 review · 4 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For a fixed-degree random regular graph, the normalized projection of the second eigenvector onto any fixed direction is Gaussian up to a tracked $N^{-1/6+\varepsilon}$ error, proved with explicit constants.

desk verdict The claimed Berry-Esseen bound rests on an edge local law built from the wrong Stieltjes transform, and Theorem 2.3 contradicts Corollary 2.4 on the same CDF. read the letter →

arxiv 2507.12502 v1 pith:EWB3A676 submitted 2025-07-16 math.PR cs.DMmath.COmath.SP

Leonhard Nagel This is my paper · ORCID
classification math.PRcs.DMmath.COmath.SP MSC 60B2015B5205C8060F05
keywords randomregulargraphsedgeeigenvectoruniversalityBerry-EsseenboundsDysonBrownianmotionisotropiclocallawsemicircledelocalizationspectralalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish a quantitative version of edge eigenvector universality for sparse regular graphs. For a uniformly random $d$-regular graph on $N$ vertices with fixed $d\ge 3$ — every vertex has degree exactly $d$ — and any deterministic unit vector $\mathbf{q}$ orthogonal to the all-ones vector, the overlap $\sqrt{N}\langle\mathbf{q},\mathbf{u}_2\rangle$ of the second eigenvector with $\mathbf{q}$ has a distribution function that is within $C_d N^{-1/6+\varepsilon}$ of the standard normal, uniformly in $x$. If true, this is the first explicit convergence rate for edge eigenvector statistics in this setting, with the constant $C_d\le\tilde{C}d^3\varepsilon^{-10}$ tracked through the proof. The payoff is finite-size applicability: spectral clustering, network centrality, and delocalization arguments on concrete graphs need quantitative bounds rather than only a limiting statement. The paper also proves joint convergence of the top $K$ edge eigenvectors to independent Gaussians for $K\le N^{1/10-\delta}$, and gives evidence that $N^{-1/6}$ is the best rate available.

What carries the argument

The load-bearing mechanism is constrained Dyson Brownian motion, the flow $\mathrm{d}\tilde{H}_t=-\tfrac12\tilde{H}_t\,\mathrm{d}t+N^{-1/2}\mathrm{d}W_t$ on symmetric matrices with zero row sums, so $\tilde{H}_t\mathbf{e}=0$ at every time. The overlap processes $X_i^{(q)}(t)=\sqrt{N}\langle\mathbf{q},\mathbf{u}_i(t)\rangle$ obey an SDE whose error term is controlled by a sharp edge isotropic local law: for $z=E+\mathrm{i}\eta$ with $|E-2|\le N^{-2/3+\varepsilon}$ and $\eta\ge N^{-2/3}$, the claim is $|\langle\mathbf{q},(\tilde{H}_t-z)^{-1}\mathbf{q}\rangle-m_{\mathrm{sc}}(z)|\le C(d,\varepsilon)N^{-5/6+\varepsilon}$, where $m_{\mathrm{sc}}$ is the Stieltjes transform of the semicircle law. That local law feeds the second- and fourth-moment evolution of overlaps, the decorrelation estimates between different eigenvectors, and the fourth-order cumulant comparison with constrained GOE at the critical time. A time-reversed diffusion estimate bounds the change in expectation between time zero and $t_*$, and that backward step is where the final $N^{-1/6}$ loss enters.

What would settle it

Numerically evaluate $\langle\mathbf{q},(\tilde{H}-(2+\mathrm{i}N^{-2/3}))^{-1}\mathbf{q}\rangle$ for a random 3-regular graph at large $N$, with $\mathbf{q}$ a fixed unit vector orthogonal to the all-ones vector, and compare with $m_{\mathrm{sc}}(2+\mathrm{i}N^{-2/3})$; the paper's chain requires this difference to shrink like $N^{-5/6+\varepsilon}$, whereas the fixed-degree edge limit differs from the semicircle value by an $O(1)$ constant, so an observed $O(1)$ or even $N^{-1/3}$ discrepancy would refute the sharp local law that the bound depends on.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.3: for any fixed-degree random regular graph and any fixed direction $\mathbf{q}\perp\mathbf{e}$, the cumulative distribution function of $\sqrt{N}\langle\mathbf{q},\mathbf{u}_2\rangle$ satisfies $\sup_x|\mathbb{P}(\sqrt{N}\langle\mathbf{q},\mathbf{u}_2\rangle\le x)-\Phi(x)|\le C_d N^{-1/6+\varepsilon}$ with $C_d\le\tilde{C}d^3\varepsilon^{-10}$. The proof flows the adjacency matrix through a degree-constrained Ornstein-Uhlenbeck process, compares once at the critical time $t_*=N^{-1/3+\varepsilon}$ with a constrained Gaussian orthogonal ensemble using a fourth-order cumulant expansion, and then propagates the comparison backward to the original graph. A second theorem gives joint universality: the projections of the top $K$ edge eigenvectors onto any finite collection of test vectors converge to independent standard Gaussians for $K\le N^{1/10-\delta}$, with multivariate Berry-Esseen rate $C_{d,m}K^{3/2}N^{-1/6+\varepsilon}$ over convex sets. Because the distribution-function statement requires smoothing an indicator, the paper's corollary for cumulative distribution functions carries the weaker rate $N^{-5/36+\varepsilon}$.

Load-bearing premise

The proof rests on the sharp edge isotropic local law — that near $E=2$, the resolvent entry $\langle\mathbf{q},(\tilde{H}-z)^{-1}\mathbf{q}\rangle$ is within $N^{-5/6+\varepsilon}$ of the semicircle Stieltjes transform at $z=2+\mathrm{i}N^{-2/3}$ — because the overlap SDE errors, moment evolution, and cumulant comparison all inherit this bound; if that comparison fails, the final rate collapses.

Editorial extensions

If this is right

  • For any fixed $d$, the projection of the second eigenvector onto a fixed direction is Gaussian up to an explicit $N^{-1/6+\varepsilon}$ error, so eigenvector statistics on finite graphs come with concrete bounds rather than only as limits.
  • The top $K$ edge eigenvectors are jointly Gaussian and mutually independent in the limit for $K\le N^{1/10-\delta}$, giving a quantitative foundation for multi-dimensional spectral embeddings and clustering.
  • The Berry-Esseen bound implies quantitative delocalization: with high probability $\|\mathbf{u}_2\|_\infty\le C\sqrt{\log N}/\sqrt{N}$, and the mass of $\mathbf{u}_2$ on large subsets is controlled up to explicit error.
  • Spectral embeddings built from $K$ edge eigenvectors separate large vertex sets by $\Omega(1/\sqrt{K})$ with high probability, the paper's stated justification for spectral clustering on sparse regular graphs.
  • The paper's optimality analysis, from edge spacing $\Theta(N^{-2/3})$, the minimal mixing time $t_*\sim N^{-1/3}$, and consistency across methods, predicts that no dynamical proof can beat the $N^{-1/6}$ rate for fixed-degree regular graphs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper states the sharp local law against the semicircle Stieltjes transform, but for fixed $d$ the natural edge limit is the fixed-degree resolvent, which differs from semicircle by an $O(1)$ constant at $E=2$; if that discrepancy is not cancelled, the claimed $N^{-5/6+\varepsilon}$ bound would need repair. This is an editorial caution, not a claim of the paper.
  • The same constraint-preserving single-scale scheme should carry over to other ensembles with a linear invariant — random lifts, graphs with fixed degree sequence — and would predict the same $N^{-1/6}$-type Berry-Esseen rate there.
  • The stated bound $K\le N^{1/10-\delta}$ is called technical in the paper; a direct numerical measurement of the covariance matrix of the top $K$ overlaps for $K$ in $[N^{1/10},N^{1/3}]$ would show whether the decorrelation mechanism genuinely degrades at that scale.
  • If $N^{-1/6}$ is a true barrier, spectral algorithms whose outputs are functions of edge eigenvector projections should show fluctuations of order $N^{-1/6}$ at finite $N$; that is testable by simulation of clustering or embedding errors.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The paper claims quantitative Berry-Esseen bounds for edge eigenvector overlaps in fixed-degree random regular graphs. The central object is the normalized overlap sqrt(N)<q,u_2> for a deterministic unit vector q orthogonal to the all-ones vector, for which the paper states sup_x |P(sqrt(N)<q,u_2> <= x) - Phi(x)| <= C_d N^{-1/6+epsilon}. The proof proceeds through a constrained Dyson Brownian motion that preserves the degree constraint, a sharp edge isotropic local law for the resolvent near the spectral edge, a moment evolution argument, a fourth-order cumulant comparison with constrained GOE, and a backward stability estimate. The paper also claims a joint central limit theorem for several top eigenvectors and gives heuristic evidence that the N^{-1/6} rate is optimal. The claimed contributions are strong and quantitative, but the manuscript contains a direct contradiction between the main theorem and its corollary, and the key edge isotropic local law is derived from the wrong limiting law for fixed-degree regular graphs.

Significance. If the results were correct, this would be a significant advance: explicit rates and constants for edge eigenvector universality would complement the qualitative results of He-Huang-Yau and would provide finite-size tools for spectral algorithms. The paper is also commendable for attempting to track all constants explicitly and for proposing a single-scale comparison method. However, the two most load-bearing components are inconsistent or incorrect: the main theorem and its corollary give different rates for the same cumulative distribution function, and the sharp edge local law compares the resolvent against the semicircle law instead of the Kesten-McKay law appropriate for fixed d-regular graphs. Because these issues are central, the claimed results are not supported by the manuscript.

major comments (4)
  1. [Section 2.3 (Theorem 2.3, Corollary 2.4, Remark 2.5)] Theorem 2.3 and Corollary 2.4 state different rates for the identical object: Theorem 2.3 asserts sup_x |P(sqrt(N)<q,u_2> <= x) - Phi(x)| <= C_d N^{-1/6+epsilon}, while Corollary 2.4 asserts the same supremum is <= C_d N^{-5/36+epsilon}. Remark 2.5 then says that Theorem 2.3 applies only to smooth test functions, although both the theorem and the abstract state a bound for the cumulative distribution function. Since the proofs in Section 7.2 and Appendix B lead to these different rates, the main quantitative claim is internally inconsistent and needs to be resolved before the paper can be evaluated.
  2. [Section 4.2, Eq. (4.5), Theorem 4.3] The sharp edge isotropic local law compares <q,G(z)q> with the semicircle Stieltjes transform m_sc, but for a fixed-degree d-regular graph the correct deterministic limit is the Kesten-McKay transform, not m_sc. Moreover, Eq. (4.5) states G_qq(z) = -1/(z + (d-1)G_qq(z)), which is the self-consistent equation for the Kesten-McKay law with variance parameter d-1, not the semicircle equation m_sc = -1/(z + m_sc). Near the edge, for z = 2 + i eta with eta = N^{-2/3}, the difference m_KM(z) - m_sc(z) tends to an O(1) constant, whereas the claimed right-hand side N^{-5/6+epsilon} tends to zero. Thus Theorem 4.3 is false as stated for every fixed d. Since Proposition 4.2, Theorem 4.5, and the backward stability argument in Section 7 all invoke Theorem 4.3, the final Berry-Esseen bound does not follow.
  3. [Section 6.3, proof of Theorem 6.5] The proof of Theorem 6.5 chooses delta = N^{-1/10} and obtains an intermediate error of C N^{-1/3+2epsilon} + C N^{-1/10}, but the displayed statement then drops the N^{-1/10} term and claims an error C_GOE N^{-1/2} + C N^{-1/3+2epsilon}. The dropped term is larger than the N^{-1/3+2epsilon} term and is also larger than the N^{-1/6+3epsilon} backward stability bound used in the proof of Theorem 2.3, so the advertised rate is not derived from the given estimates.
  4. [Section 6.3, Lemma 6.4] The proof of Lemma 6.4 applies the classical Berry-Esseen theorem for sums of independent random variables to the GOE eigenvector overlap X = sqrt(N)<q,v_2^W>, although the eigenvector components are not independent. The subsequent claims about the Lyapunov ratio and the O(N^{-1/2}) rate are asserted rather than proved; the cited references may contain such quantitative eigenvector CLT results, but the derivation presented here does not support the stated bound.
minor comments (3)
  1. [Abstract and Section 2.3] The abstract says the theorem holds for any d-regular graph on N vertices, while Theorem 2.3 states that G is a uniformly random d-regular graph; the deterministic statement is different from the probabilistic one and should be clarified.
  2. [Section 1.2] The informal statement says indicator functions achieve the rate N^{-5/36+epsilon}, but the abstract and Theorem 2.3 present N^{-1/6+epsilon} for the CDF; this inconsistency should be resolved in favor of a single rate for the CDF supremum.
  3. [Section 3.3] The example calculation for a 3-regular graph with N = 10^6 contains a consistency issue: the displayed numerical bound is about 0.115 C_3, but the text in Section 1.2 suggests the statistics are within 0.05 of Gaussian for that size, and the two statements are not reconciled with the given constants.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the proof is a self-contained chain of independent estimates; the main caveat is a deterministic-limit mismatch (Kesten-McKay versus semicircle), which is a correctness concern, not a circular reduction.

full rationale

The central derivation does not reduce to its own inputs. Theorem 2.3 is obtained by a linear chain: the overlap SDE (Proposition 4.2), the edge local law (Theorem 4.3), moment evolution (Theorem 4.5), decorrelation (Theorem 5.1), cumulant comparison with constrained GOE (Theorem 6.3), a GOE Berry-Esseen lemma (Lemma 6.4), and backward propagation (Theorem 7.2). These components are stated as separate theorems rather than as restatements of the target, and no parameter of the final bound is fitted to the eigenvector overlap data. The comparison at time t* uses the constrained GOE ensemble as an external benchmark and cites independent known results; the paper contains no load-bearing self-citations by the same author. Claims that HHY implicitly contain the N^{-1/6} rate are presented as supporting evidence for optimality and do not feed into the proof of Theorem 2.3. The most serious mathematical concern is that for fixed d the deterministic resolvent limit near the edge is the Kesten-McKay Stieltjes transform, not the semicircle transform, while the proof in Section 4.2 writes the same self-consistent equation for m_sc as for G_qq (Eq. 4.5 and the display before Eq. 4.7); this is an internal inconsistency or correctness failure, not a circularity, because the local law is not derived from the conclusion it is used to prove. Similarly, the smoothing error in Theorem 6.5 appears to be understated, but that too is a quantitative error rather than a circular reduction. Overall, the claimed Berry-Esseen bound does not reduce by definition to its assumptions, so the circularity score is 0.

Assumptions & free parameters 2 free parameters · 3 assumptions · 0 invented entities

The proof depends on an incorrect spectral-law assumption (semicircle instead of Kesten-McKay) and on a time-reversal theorem whose regularity conditions are not verified. The chosen scales t* and δ are hand-balanced parameters, not data-fitted. No new physical entities are introduced.

free parameters (2)
  • critical time t* = N^{-1/3+ε}
    Comparison time chosen by hand to balance diffusion and drift; not derived from data.
  • smoothing parameter δ = N^{-5/36}
    Chosen to balance smoothing and truncation errors in the indicator function argument.
assumptions (3)
  • ad hoc to paper The spectral measure of the normalized adjacency matrix of a d-regular graph is asymptotically the semicircle law, so G_qq ≈ m_sc.
    This is false for fixed d; the limit is the Kesten-McKay law. Invoked in Eq. (4.5) and Theorem 4.3.
  • domain assumption The overlap SDE has bounded and Lipschitz coefficients so Haussmann-Pardoux time reversal applies.
    Not verified; coefficients have 1/(λ_i-λ_j) singularities at eigenvalue collisions. Used in Lemma 7.1 and Theorem 7.2.
  • domain assumption Eigenvalue gap summation Σ_j (λ_i-λ_j)^{-2} ≈ π^2/6 N^{4/3} using semicircle edge density.
    The constant and scaling depend on the edge density of states, which for d-regular graphs is Kesten-McKay, not semicircle. Used in proof of Theorem 4.5.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants." pith.science (2026). https://pith.science/paper/EWB3A676

@misc{pith2026250712502,
  author       = {Pith},
  title        = {Pith review of: Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EWB3A676}},
  note         = {Machine review of arXiv:2507.12502}
}
abstract

We establish the first quantitative Berry-Esseen bounds for edge eigenvector statistics in random regular graphs. For any $d$-regular graph on $N$ vertices with fixed $d \geq 3$ and deterministic unit vector $\mathbf{q} \perp \mathbf{e}$, we prove that the normalized overlap $\sqrt{N}\langle \mathbf{q}, \mathbf{u}_2 \rangle$ satisfies \[ \sup_{x \in \mathbb{R}} \left|\mathbb{P}\left(\sqrt{N}\langle \mathbf{q}, \mathbf{u}_2 \rangle \leq x\right) - \Phi(x)\right| \leq C_d N^{-1/6+\varepsilon} \] where $\mathbf{u}_2$ is the second eigenvector and $C_d \leq \tilde{C}d^3\varepsilon^{-10}$ for an absolute constant $\tilde{C}$. This provides the first explicit convergence rate for the recent edge eigenvector universality results of He, Huang, and Yau \cite{HHY25}. Our proof introduces a single-scale comparison method using constrained Dyson Brownian motion that preserves the degree constraint $\tilde{H}_t\mathbf{e} = 0$ throughout the evolution. The key technical innovation is a sharp edge isotropic local law with explicit constant $C(d,\varepsilon) \leq \tilde{C}d\varepsilon^{-5}$, enabling precise control of eigenvector overlap dynamics. At the critical time $t_* = N^{-1/3+\varepsilon}$, we perform a fourth-order cumulant comparison with constrained GOE, achieving optimal error bounds through a single comparison rather than the traditional multi-scale approach. We extend our results to joint universality for the top $K$ edge eigenvectors with $K \leq N^{1/10-\delta}$, showing they converge to independent Gaussians. Through analysis of eigenvalue spacing barriers, critical time scales, and comparison across multiple proof methods, we provide evidence that the $N^{-1/6}$ rate is optimal for sparse regular graphs. All constants are tracked explicitly throughout, enabling finite-size applications in spectral algorithms and network analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Sharp Square Root Bounds for Edge Eigenvector Universality in Sparse Random Regular Graphs

    math.PR 2025-07 reject novelty 6.0 of 10

    A claimed optimal Berry-Esseen bound of order sqrt(d) N^{-1/6+eps} for eigenvector projections of random d-regular graphs, with a matching lower bound.

Reference graph

Works this paper leans on

57 extracted references · 57 canonical work pages · cited by 1 Pith paper

  1. [1]

    Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , Cambridge University Press, 2010

    Greg W. Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , Cambridge University Press, 2010

    work page 2010

  2. [2]

    Roland Bauerschmidt, Jiaoyang Huang, Antti Knowles, and Horng-Tzer Yau, Edge rigidity and universality of random regular graphs of intermediate degree , Geometric and Functional Analysis 30 (2020), 693–769

    work page 2020

  3. [3]

    Florent Benaych-Georges and Antti Knowles, Lectures on the local semicircle law for wigner matrices, 2016

    work page 2016

  4. [4]

    2, 311–323

    Vidmantas Bentkus, A lyapunov-type bound in Rd, Theory of Probability & Its Applications 49 (2005), no. 2, 311–323

    work page 2005

  5. [5]

    Berry, Regular and irregular semiclassical wavefunctions , Journal of Physics A: Mathematical and General 10 (1977), no

    Michael V. Berry, Regular and irregular semiclassical wavefunctions , Journal of Physics A: Mathematical and General 10 (1977), no. 12, 2083

    work page 1977

  6. [6]

    Rajendra Bhatia, Matrix analysis , Springer, 1997

    work page 1997

  7. [7]

    1, 127–167

    Philippe Biane, Philippe Bougerol, and Neil O’Connell, Littelmann paths and brownian paths, Duke Mathematical Journal 130 (2005), no. 1, 127–167

    work page 2005

  8. [8]

    Oriol Bohigas, Marie-Joya Giannoni, and Charles Schmit, Characterization of chaotic quan- tum spectra and universality of level fluctuation laws , Physical Review Letters 52 (1984), no. 1, 1–4

    work page 1984

Show all 57 references
  1. [9]

    B´ ela Bollob´ as,Random graphs, Cambridge University Press, 2001

    2001

  2. [10]

    5, 1170–1182

    Phillip Bonacich, Power and centrality: A family of measures , American Journal of Sociology 92 (1987), no. 5, 1170–1182

    1987

  3. [11]

    6, 1393–1439

    Charles Bordenave, A new proof of friedman ’s second eigenvalue theorem and its extension to random lifts, Annales scientifiques de l’´Ecole Normale Sup´ erieure53 (2020), no. 6, 1393–1439

    2020

  4. [12]

    Paul Bourgade, Eigenvector statistics of large random matrices , 2017, Lecture Notes

    2017

  5. [13]

    Paul Bourgade, L´ aszl´ o Erd˝ os, and Horng-Tzer Yau,Edge universality of beta ensembles , Communications in Mathematical Physics 332 (2014), 261–353

    2014

  6. [14]

    Ziliang Che and Patrick Lopatto, Universality of the least singular value for sparse random matrices, Electron. J. Probab. 24 (2019), 1–53

    2019

  7. [15]

    Percy Deift, Orthogonal polynomials and random matrices: a riemann-hilbert approach , American Mathematical Society, 1999

    1999

  8. [16]

    Dyson, A brownian-motion model for the eigenvalues of a random matrix , Journal of Mathematical Physics 3 (1962), no

    Freeman J. Dyson, A brownian-motion model for the eigenvalues of a random matrix , Journal of Mathematical Physics 3 (1962), no. 6, 1191–1198. BERRY-ESSEEN BOUNDS FOR EDGE EIGENVECTORS 29

    1962

  9. [17]

    L´ aszl´ o Erd˝ os and Antti Knowles,Quantum diffusion and eigenfunction delocalization in a random band matrix model , Communications in Mathematical Physics 303 (2011), 509–554

    2011

  10. [18]

    L´ aszl´ o Erd˝ os, Antti Knowles, Horng-Tzer Yau, and Jun Yin,Delocalization and diffusion profile for random band matrices, Communications in Mathematical Physics 323 (2013), 367– 416

    2013

  11. [19]

    3, 1435–1515

    L´ aszl´ o Erd˝ os, Horng-Tzer Yau, and Jun Yin,Rigidity of eigenvalues of generalized wigner matrices, Advances in Mathematics 229 (2012), no. 3, 1435–1515

    2012

  12. [20]

    3B, 2279–2375

    L´ aszl´ o Erd˝ os et al.,Spectral statistics of erd˝ os-r´ enyi graphs i: Local semicircle law, Annals of Probability 41 (2013), no. 3B, 2279–2375

    2013

  13. [21]

    Forrester, Log-gases and random matrices , Princeton University Press, 2010

    Peter J. Forrester, Log-gases and random matrices , Princeton University Press, 2010

    2010

  14. [22]

    910, viii–100

    Joel Friedman, A proof of alon ’s second eigenvalue conjecture and related problems, Memoirs of the American Mathematical Society 195 (2008), no. 910, viii–100

    2008

  15. [23]

    Grabiner, Brownian motion in a weyl chamber, non-colliding particles, and random matrices, Annales de l’Institut Henri Poincar´ e, Probabilit´ es et Statistiques35 (1999), no

    David J. Grabiner, Brownian motion in a weyl chamber, non-colliding particles, and random matrices, Annales de l’Institut Henri Poincar´ e, Probabilit´ es et Statistiques35 (1999), no. 2, 177–204

    1999

  16. [24]

    Tropp, Finding structure with random- ness: Probabilistic algorithms for constructing approximate matrix decompositions , SIAM Review 53 (2011), no

    Nathan Halko, Per-Gunnar Martinsson, and Joel A. Tropp, Finding structure with random- ness: Probabilistic algorithms for constructing approximate matrix decompositions , SIAM Review 53 (2011), no. 2, 217–288

    2011

  17. [25]

    Haussmann and Etienne Pardoux, Time reversal of diffusions, Annals of Probability 14 (1986), no

    Ulrich G. Haussmann and Etienne Pardoux, Time reversal of diffusions, Annals of Probability 14 (1986), no. 4, 1188–1205

    1986

  18. [26]

    Yukun He, Jiaoyang Huang, and Horng-Tzer Yau, Gaussian waves and edge eigenvectors of random regular graphs, 2025, arXiv:2502.08897

    2025 arXiv

  19. [27]

    Hejhal and Barry N

    Dennis A. Hejhal and Barry N. Rackner, On the topography of maass waveforms for PSL(2, z), Experimental Mathematics 1 (1992), no. 4, 275–305

    1992

  20. [28]

    Jiaoyang Huang and Horng-Tzer Yau, Edge universality of random regular graphs of growing degrees, 2023, arXiv:2305.01428v2

    2023 arXiv

  21. [29]

    5, 1477–1504

    Dmitry Jakobson, Quantum unique ergodicity for eisenstein series on PSL2(Z)\PSL2(R), Annales de l’institut Fourier 44 (1994), no. 5, 1477–1504

    1994

  22. [30]

    Johnstone, On the distribution of the largest eigenvalue in principal components analysis, Annals of Statistics 29 (2001), no

    Iain M. Johnstone, On the distribution of the largest eigenvalue in principal components analysis, Annals of Statistics 29 (2001), no. 2, 295–327

    2001

  23. [31]

    5, 2327–2351

    Michel Journ´ ee, Francis Bach, Pierre-Antoine Absil, and Rodolphe Sepulchre, Low-rank op- timization on the cone of positive semidefinite matrices , SIAM Journal on Optimization 20 (2010), no. 5, 2327–2351

    2010

  24. [32]

    Tosio Kato, Perturbation theory for linear operators , Springer, 1966

    1966

  25. [33]

    8, 3058–3085

    Makoto Katori and Hideki Tanemura, Symmetry of matrix-valued stochastic processes and noncolliding diffusion particle systems , Journal of Mathematical Physics 45 (2004), no. 8, 3058–3085

    2004

  26. [34]

    Khorunzhy, Boris A

    Alexei M. Khorunzhy, Boris A. Khoruzhenko, and Leonid A. Pastur, Asymptotic properties of large random matrices with independent entries , Journal of Mathematical Physics 37 (1996), no. 10, 5033–5060

    1996

  27. [35]

    Yin, Anisotropic local laws for random matrices , Probability Theory and Related Fields 169 (2017), 257–352

    Antti Knowles and J. Yin, Anisotropic local laws for random matrices , Probability Theory and Related Fields 169 (2017), 257–352

    2017

  28. [36]

    Antti Knowles and Jun Yin, Eigenvector distribution of wigner matrices , Probability Theory and Related Fields 155 (2013), 543–582

    2013

  29. [37]

    Ji Oon Lee and Kevin Schnelli, Local law and tracy-widom limit for sparse random matrices , Probability Theory and Related Fields 171 (2018), 543–616

    2018

  30. [38]

    1, 215–237

    Jing Lei and Alessandro Rinaldo, Consistency of spectral clustering in stochastic block models, Annals of Statistics 43 (2015), no. 1, 215–237

    2015

  31. [39]

    Phillips, and Peter Sarnak, Ramanujan graphs, Combinatorica 8 (1988), no

    Alexander Lubotzky, Ralph S. Phillips, and Peter Sarnak, Ramanujan graphs, Combinatorica 8 (1988), no. 3, 261–277

    1988

  32. [40]

    5, 1778– 1840

    Anna Lytova and Leonid Pastur, Central limit theorem for linear eigenvalue statistics of random matrices with independent entries , Annals of Probability 37 (2009), no. 5, 1778– 1840

    2009

  33. [41]

    Grigory A. Margulis, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Problems of Information Transmission 24 (1988), no. 1, 51–60

    1988

  34. [42]

    Tropp, Randomized numerical linear algebra: Founda- tions and algorithms , Acta Numerica 29 (2020), 403–572

    Per-Gunnar Martinsson and Joel A. Tropp, Randomized numerical linear algebra: Founda- tions and algorithms , Acta Numerica 29 (2020), 403–572. 30 LEONHARD NAGEL

    2020

  35. [43]

    1, 44–62

    Moshe Morgenstern, Existence and explicit constructions of q + 1 regular ramanujan graphs for every prime power q, Journal of Combinatorial Theory, Series B 62 (1994), no. 1, 44–62

    1994

  36. [44]

    Mark Newman, Networks: an introduction , Oxford University Press, 2010

    2010

  37. [45]

    Andrew Ng, Michael Jordan, and Yair Weiss, On spectral clustering: Analysis and an algo- rithm, Proceedings of the 15th International Conference on Neural Information Processing Systems: Natural and Synthetic, 2001, pp. 849–856

    2001

  38. [46]

    report, Stanford InfoLab, 1999

    Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd, The pagerank citation ranking: Bringing order to the web , Tech. report, Stanford InfoLab, 1999

    1999

  39. [47]

    3-4, 193–231, English translation: Nonlinear filtering, prediction and smoothing

    ´Etienne Pardoux, ´Equations du filtrage non lin´ eaire de la pr´ ediction et du lissage, Stochastics 6 (1982), no. 3-4, 193–231, English translation: Nonlinear filtering, prediction and smoothing

    1982

  40. [48]

    4, 1878–1915

    Karl Rohe, Sourav Chatterjee, and Bin Yu, Spectral clustering and the high-dimensional stochastic blockmodel, Annals of Statistics 39 (2011), no. 4, 1878–1915

    2011

  41. [49]

    Peter Sarnak, Arithmetic quantum chaos , Israel Mathematical Conference Proceedings 8 (1995), 183–236

    1995

  42. [50]

    8, 888–905

    Jianbo Shi and Jitendra Malik, Normalized cuts and image segmentation , IEEE Transactions on Pattern Analysis and Machine Intelligence 22 (2000), no. 8, 888–905

    2000

  43. [51]

    3, 2223–2251

    Sasha Sodin, The spectral edge of some random band matrices , Annals of Mathematics 172 (2010), no. 3, 2223–2251

    2010

  44. [52]

    132, American Mathematical Society, 2012

    Terence Tao, Topics in random matrix theory , Graduate Studies in Mathematics, vol. 132, American Mathematical Society, 2012

    2012

  45. [53]

    Tracy and H

    Craig A. Tracy and H. Widom, Level spacing distributions and the bessel kernel , Communi- cations in Mathematical Physics 161 (1994), 289–310

    1994

  46. [54]

    Tracy and Harold Widom, Level-spacing distributions and the airy kernel , Commu- nications in Mathematical Physics 159 (1994), 151–174

    Craig A. Tracy and Harold Widom, Level-spacing distributions and the airy kernel , Commu- nications in Mathematical Physics 159 (1994), 151–174

    1994

  47. [55]

    4, 395–416

    Ulrike Von Luxburg, A tutorial on spectral clustering , Statistics and Computing 17 (2007), no. 4, 395–416

    2007

  48. [56]

    Woodruff, Sketching as a tool for numerical linear algebra , Foundations and Trends in Theoretical Computer Science 10 (2014), no

    David P. Woodruff, Sketching as a tool for numerical linear algebra , Foundations and Trends in Theoretical Computer Science 10 (2014), no. 1-2, 1–157

    2014

  49. [57]

    X ℓ ∂2X (q) i ∂ ˜Hjk ∂ ˜Hjℓ + X ℓ ∂2X (q) i ∂ ˜Hjk ∂ ˜Hℓk #(A.17) = − 1 N X j X p̸=i X (q) p (λi − λp)2

    Nicholas C. Wormald, Models of random regular graphs, London Mathematical Society Lecture Note Series (1999), 239–298. Appendix A. Detailed Error Analysis for Overlap SDE We provide complete calculations for the error term Ei(t) in the proposition on overlap SDE convergence. A...

    1999

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.