Birs- 16w5111: Algebraic and Spectral Graph Theory
-
Title: Two existence proofs for Ramanujan graphs
Speaker:
Link:
-
Title: Strongly refuting random constraint satisfaction problems below the spectral threshold
Speaker:
Link:
-
Title: Open problems on random walks and expanders
Speaker:
Link:
-
Title: Improved Spectral Sparsification and Kadison-Singer for Sums of Higher-rank Matrices
Speaker:
Link:
-
Title: Bakry-Emery curvature functions of graphs
Speaker:
Link:
-
Title: High-dimensional permutations and discrepancy
Speaker:
Link:
-
Title: Non-backtracking random walks
Speaker:
Link:
-
Title: Spectral algorithms via sums-of-squares proofs
Speaker:
Link:
-
Title: Low Radius Decompositions
Speaker:
Link:
-
Title: Interior point based maximum flow algorithms make sense
Speaker:
Link:
-
Title: Algorithm Frameworks Based on Adaptive Sampling
Speaker:
Link:
-
Title: On fully dynamic graph sparsifiers
Speaker:
Link:
-
Title: Hermitian adjacency matrix of directed graphs
Speaker:
Link:
-
Title: Strongly Rayleigh distributions and their Applications in Algorithm Design
Speaker:
Link:
-
Title: Sheaves on Graphs, Laplacians, and Applications
Speaker:
Link:
-
Title: Quantum walks on graphs
Speaker:
Link:
-
Title: Iteratively Reweighted Least Squares Method for Sparse Recovery
Speaker:
Link:
-
Title: Distributed Graph Clustering by Load Balancing
Speaker:
Link:
-
Title: Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
Speaker:
Link:
-
Title: Partitioning a Probability Distribution from a Sample
Speaker:
Link: