Department of Mathematical SciencesEvents People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Algorithms, Combinatorics and Optimization Seminar
For more information, please visit the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.
Carnegie Mellon University offers an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. This program is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group). (Learn more...)
University of Washington
Title: Eigenvalues of sparse random regular graphs
Abstract: Adjacency matrices of sparse random regular graphs are long conjectured to lie within the universality class of random matrices. However, there are few rigorously known results. We focus on fluctuations of linear eigenvalue statistics of a stochastic process of such adjacency matrices growing in dimension. The idea is to compare with eigenvalues of minors of Wigner matrices whose fluctuation converges to the Gaussian Free Field. We show that linear eigenvalue statistics can be described by a family of Yule processes with immigration. Certain key features of the Free Field emerge as the degree tends to infinity. Based on joint work with Tobias Johnson.
Date: Wednesday, October 24, 2012
Time: 5:00 pm
Location: Wean 5421
Submitted by: Loh