Completed
Bottleneck for Achieving (1+e) log2 n-cliques - Proof ideas
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Revisiting Jerrum's Metropolis Process for the Planted Clique Problem
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Cliques in Random Graphs
- 3 The Planted Clique Model: Inference Task
- 4 The Planted Clique Model - Brief Literature Review
- 5 Jerrum's Result and Open Questions
- 6 Bottleneck for Achieving (logn) Overlap - Theorem
- 7 Bottleneck for Achieving (logn) Overlap - Proof Ideas
- 8 Bottleneck for Achieving (1+e) log2 n-cliques - Proof ideas
- 9 Conclusion - Comments/Future questions
