Finding Sparse Cuts Locally using Evolving Sets
Reid Andersen [Microsoft] ,Yuval Peres [Microsoft]
2009
Date
41
Slides
Previous
Next
Useful Information
- Related publication: Yuval Peres: Andersen, Reid, Shayan Oveis Gharan, Yuval Peres, and Luca Trevisan. "Almost optimal local graph clustering using evolving sets." Journal of the ACM (JACM) 63, no. 2 (2016): 1-31.
- Related publication: Andersen, Reid, and Yuval Peres. "Finding sparse cuts locally using evolving sets." In Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 235-244. 2009.
- Related Video: Local Partitioning and hidden Cliques in Massive Graphs. First 2015 Hotelling Lecture, Part 2
- Related Video: Yuval Peres - Markov Mixing, lecture 4, Technion
- Related Book: Markov chains and mixing times