Pith. sign in

Extreme eigenvalues of Laplacian random matrices with Gaussian entries

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

A Laplacian matrix is a real symmetric matrix whose row and column sums are zero. We investigate the limiting distribution of the largest eigenvalues of a Laplacian random matrix with Gaussian entries. Unlike many classical matrix ensembles, this random matrix model contains dependent entries. Our main results show that the extreme eigenvalues of this model exhibit Poisson statistics. In particular, after properly shifting and scaling, we show that the largest eigenvalue converges to the Gumbel distribution as the dimension of the matrix tends to infinity. While the largest diagonal entry is also shown to have Gumbel fluctuations, there is a rather surprising difference between its deterministic centering term and the centering term required for the largest eigenvalues.

citation-role summary

background 1

citation-polarity summary

fields

math.PR 1

years

2024 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Eigenvalue gaps of the Laplacian of random graphs

math.PR · 2024-12-31 · conditional · novelty 7.0

For an Erdős-Rényi graph with fixed edge probability, the random graph Laplacian has simple spectrum with overwhelmingly high probability, with a quantitative n^{-3/2-o(1)} lower bound on the minimum gap.

citing papers explorer

Showing 1 of 1 citing paper.

  • Eigenvalue gaps of the Laplacian of random graphs math.PR · 2024-12-31 · conditional · none · ref 12 · internal anchor

    For an Erdős-Rényi graph with fixed edge probability, the random graph Laplacian has simple spectrum with overwhelmingly high probability, with a quantitative n^{-3/2-o(1)} lower bound on the minimum gap.