The Tracy-Widom law for some sparse random matrices

Sasha Sodin

doi:10.1007/s10955-009-9813-2

The Tracy-Widom law for some sparse random matrices

Sasha Sodin^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

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 language	English
Pages (from-to)	834-841
Number of pages	8
Journal	Journal of Statistical Physics
Volume	136
Issue number	5
DOIs	https://doi.org/10.1007/s10955-009-9813-2
State	Published - 2009
Externally published	Yes

Keywords

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

Access to Document

10.1007/s10955-009-9813-2

Cite this

@article{44685d742a67413a9c810e95902d8430,

title = "The Tracy-Widom law for some sparse random matrices",

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.",

keywords = "Airy point process, Edge of the spectrum, Random graph, Tracy-Widom distribution",

author = "Sasha Sodin",

year = "2009",

doi = "10.1007/s10955-009-9813-2",

language = "אנגלית",

volume = "136",

pages = "834--841",

journal = "Journal of Statistical Physics",

issn = "0022-4715",

publisher = "Springer",

number = "5",

}

TY - JOUR

T1 - The Tracy-Widom law for some sparse random matrices

AU - Sodin, Sasha

PY - 2009

Y1 - 2009

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

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

KW - Airy point process

KW - Edge of the spectrum

KW - Random graph

KW - Tracy-Widom distribution

UR - https://www.scopus.com/pages/publications/70350418110

U2 - 10.1007/s10955-009-9813-2

DO - 10.1007/s10955-009-9813-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:70350418110

SN - 0022-4715

VL - 136

SP - 834

EP - 841

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

IS - 5

ER -

The Tracy-Widom law for some sparse random matrices

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this