Finding and Using Expanders in Locally Sparse Graphs and in Sparse Random Graphs

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=QkYD8_m2yDk


Duration: 48:44
238 views
3

Michael Krivelevich, Tel Aviv University
https://simons.berkeley.edu/talks/michael-krivelevich-02-03-2017
Expanders and Extractors



Other Videos By Simons Institute for the Theory of Computing


2017-02-14Interactive Clustering
2017-02-13Stochastic Variance Reduction Methods for Policy Evaluation
2017-02-13Words, Pictures, and Common Sense
2017-02-13Interactively Learning Robot Objective Functions
2017-02-13Machine Teaching in Interactive Learning
2017-02-13Machine Learning from Verbal User Instruction
2017-02-07Fundamental Techniques in Pseudorandomness V
2017-02-07The Diameter of the Symmetric Group: Ideas and Tools
2017-02-03Improved Deterministic Randomness Extraction from Non-Binary Santha-Vazirani Sources
2017-02-03Spectral Gaps and Geometric Representations
2017-02-03Finding and Using Expanders in Locally Sparse Graphs and in Sparse Random Graphs
2017-02-02Pseudorandomness When the Odds Are Against You
2017-02-02What are High-Dimensional Expanders?
2017-02-02Word-Measures on Unitary Groups
2017-02-02A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs
2017-02-01Random Walks on Ramanujan Graphs, Digraphs and Complexes
2017-02-01High Dimensional Expanders
2017-01-31Super-Approximation
2017-01-31Golden Gates, Ramanujan Complexes and Ramanujan Digraphs
2017-01-31Discrete Log Problem with Respect to the LPS generators on PGL_2
2017-01-31High Dimensional Expanders and PCPs


Tags:
Expanders and Extractors
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Michael Krivelevich