Algebraic and Spectral Graph Theory
Videos from BIRS Workshop
Adam Marcus, Princeton University
Monday Aug 1, 2016 09:32 - 10:21
Two existence proofs for Ramanujan graphs
Tselil Schramm, Stanford
Monday Aug 1, 2016 11:06 - 11:52
Strongly refuting random constraint satisfaction problems below the spectral threshold
Yuval Peres, Microsoft Research
Monday Aug 1, 2016 14:04 - 14:58
Open problems on random walks and expanders
Michael Cohen, MIT
Monday Aug 1, 2016 15:34 - 16:17
Improved Spectral Sparsification and Kadison-Singer for Sums of Higher-rank Matrices
Shiping Liu, Durham University
Monday Aug 1, 2016 16:30 - 17:25
Bakry-Emery curvature functions of graphs
Nati Linial, Hebrew University of Jerusalem
Tuesday Aug 2, 2016 09:34 - 10:29
High-dimensional permutations and discrepancy
Elchanan Mossel, MIT
Tuesday Aug 2, 2016 11:03 - 11:48
Non-backtracking random walks
David Steurer, Cornell University
Tuesday Aug 2, 2016 14:05 - 15:05
Spectral algorithms via sums-of-squares proofs
Jakub Pachocki, Harvard
Tuesday Aug 2, 2016 15:38 - 16:31
Low Radius Decompositions
Aleksander Madry, MIT
Wednesday Aug 3, 2016 09:40 - 10:34
Interior point based maximum flow algorithms make sense
Richard Peng, Georgia Institute of Technology
Wednesday Aug 3, 2016 11:14 - 12:12
Algorithm Frameworks Based on Adaptive Sampling
Yiannis Koutis, University of Puerto Rico
Wednesday Aug 3, 2016 14:04 - 14:54
On fully dynamic graph sparsifiers
Bojan Mohar, Simon Fraser University
Wednesday Aug 3, 2016 15:35 - 16:30
Hermitian adjacency matrix of directed graphs
Shayan Oveis Gharan, University of Washington
Wednesday Aug 3, 2016 16:42 - 17:42
Strongly Rayleigh distributions and their Applications in Algorithm Design
Joel Friedman, University of British Columbia
Thursday Aug 4, 2016 09:05 - 10:01
Sheaves on Graphs, Laplacians, and Applications
Chris Godsil, University of Waterloo
Thursday Aug 4, 2016 10:31 - 11:28
Quantum walks on graphs
Nisheeth Vishnoi, École Polytechnique Fédérale de Lausanne
Thursday Aug 4, 2016 11:40 - 12:40
Iteratively Reweighted Least Squares Method for Sparse Recovery
He Sun, U.Bristol
Friday Aug 5, 2016 09:07 - 09:47
Distributed Graph Clustering by Load Balancing
Aaron Sidford, Microsoft Research New England
Friday Aug 5, 2016 11:05 - 11:57
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
Gary Miller, Carnegie Mellon University
Friday Aug 5, 2016 11:59 - 12:46
Partitioning a Probability Distribution from a Sample
