The Tracy-Widom law for some sparse random matrices

From MaRDI portal
Publication:1040705




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.









This page was built for publication: The Tracy-Widom law for some sparse random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040705)