The Tracy-Widom law for some sparse random matrices

Research output: Contribution to journalArticlepeer-review

Abstract

Consider the random matrix obtained from the adjacency matrix of a random d-regular graph by multiplying every entry by a random sign. The largest eigenvalue converges, after proper scaling, to the Tracy-Widom distribution.

Original languageEnglish
Pages (from-to)834-841
Number of pages8
JournalJournal of Statistical Physics
Volume136
Issue number5
DOIs
StatePublished - 2009

Keywords

  • Airy point process
  • Edge of the spectrum
  • Random graph
  • Tracy-Widom distribution

Fingerprint

Dive into the research topics of 'The Tracy-Widom law for some sparse random matrices'. Together they form a unique fingerprint.

Cite this