Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities
Subscribers:
68,800
Published on ● Video Link: https://www.youtube.com/watch?v=Q943RPhmo3w
Yuval Peres, Microsoft Research Redmond
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/yuval-peres-2014-12-03
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Yuval Peres