DIMACS Workshop on Random Matrices

March 17 - 19, 2008
DIMACS Center, CoRE Building, Rutgers University

Organizer:
Van Vu, Rutgers University, vanvu at math.rutgers.edu
Presented under the auspices of the Special Focus on Discrete Random Systems.

Workshop Program:

Monday, March 17, 2008

 9:00 -  9:50  Breakfast and Registration 

 9:50 - 10:00  Welcome and Opening Remarks
               Tami Carpenter, DIMACS Associate Director
               
10:00 - 11:00  Lewis Lectures:
               I: Singularity and Determinant of Random Matrices
               Terence Tao, UCLA 
              
11:00 - 11:50  Free Probability and Random Matrices
               Roland Speicher, Queens University
              
11:50 -  1:20  Lunch 

 1:20 -  2:10  Logconcave Random Graphs
               Santosh Vempala, Georgia Tech
             
 2:10 -  3:00  The Rank of Random Symmetric Matrice
               Kevin Costello, IAS
              
 3:00 -  3:20  Break 

 3:20 -  4:00  On the Singular Probability of Random Discrete Matrices
               Phillip Matchett Wood, Rutgers University
              
 4:00 -  4:50  What Could Push the Edge Far from the Bulk of the Spectrum of Random Matrices?
               Gerard Ben Arous, NYU
              
 5:40          Conference Dinner 


Tuesday, March 18, 2008

 8:30 -  9:20  Breakfast and Registration 

 9:20 - 10:10  Local Dependencies in Random Matrices, the LLN, and Algebraicity
               Ofer Zeitouni, Weizman Institute
               
10:10 - 11:00  Fast Computation of Low Rank Matrix Approximations using Randomized Matrices
               Frank McSherry, Microsoft Research
             
11:00 - 11:30  Break 

11:30 - 12:30  Lewis Lectures:
               II. Least Singular Value of Random Matrices
               Terence Tao, UCLA
             
12:30 -  2:30  Lunch 

 2:30 -  3:20  Concentration and the Littlewood-Offord Problem
               Roman Vershynin, UC. Davis
              
 3:20 -  4:10  Norm of the Inverse of a Random Matrix
               Mark Rudelson, University of Missouri
             
 4:10 -  4:40  Break 

 4:40 -  5:30  Graph Sparsification by Effective Resistances
               Dan Spielman, Yale University
              
Wednesday, March 19, 2008

 8:30 -  9:20  Breakfast and Registration 

 9:20 - 10:10  Dyck Paths and Random Matrices: the Moment Method
               Sandrine Peche, Grenoble
              
10:10 - 11:00  From Random Matrices to Random Analytic Functions
               Manjunath Krishnapur, University of Toronto
            
11:00 - 11:30  Break 

11:30 - 12:30  Lewis Lectures:
               III. Eigenvalue Distributions of Random Matrices
               Terence Tao, UCLA
             
12:20 -  2:00  Lunch 

 2:00 -  2:50  Random Matrices with Linear Structure
               Mark Meckes, Case Western University
             
 2:50 -  3:40  Linear Statistics of Eigenvalues and Stein's Method
               Sourav Chatterjee, Berkeley
              
 3:40 -  4:10  Break 

 4:10 -  5:10  Random Matrix Theory: Origins, Theory, Applications and some Open Problems
               Percy Deift, NYU
              

Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on March 17, 2008.