Home /  Workshop /  Schedules /  Sparse regular random graphs: spectral density and eigenvectors

Sparse regular random graphs: spectral density and eigenvectors

Connections for Women: An Introduction to Random Matrices September 20, 2010 - September 21, 2010

September 21, 2010 (09:30 AM PDT - 10:30 AM PDT)
Speaker(s): Ioana Dumitriu (University of California, San Diego)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

v0201
Abstract Adjacency matrices of regular random graphs are a good example of non-Wigner ensembles for which the semicircle law still holds, in various regimes. The one we focus on is when the degree is polylogarithmic in the number of vertices (a "sparse" case). We show that the empirical spectral distribution converges to the semicircle law, estimate the rate of convergence (also known as the "local semicircle law"), and show some results that point toward the delocalization and lack of bias for the second through last eigenvectors.
Supplements No Notes/Supplements Uploaded
Video/Audio Files

v0201

H.264 Video v0201.m4v 744 MB video/mp4 rtsp://videos.msri.org/v0201/v0201.m4v Download
Quicktime v0201.mov 1.06 GB video/quicktime rtsp://videos.msri.org/v0201/v0201.mov Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.