Papers
Topics
Authors
Recent
Search
2000 character limit reached

Local law and Tracy-Widom limit for sparse random matrices

Published 27 May 2016 in math.PR, math-ph, and math.MP | (1605.08767v2)

Abstract: We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdos-Renyi graph model $G(N,p)$. We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy-Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdos-Renyi graph this establishes the Tracy-Widom fluctuations of the second largest eigenvalue for $p\gg N{-2/3}$ with a deterministic shift of order $(Np){-1}$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.