Presentation Dates

4/24/15: Bowen Dong, Wei Xing
4/27/15: Mojgan Mirzaie, Yi Huang
4/29/15: Anqi Liu, Mano Vikash Janardhanan
5/1/15: Ben Fish, Adam Lelkes

Possible Papers

Random Graphs

[taken by Mojgan Mirzaie] Noga Alon, Michael Krivelevich, Benny Sudakov: Finding a large hidden clique in a random graph. SODA 1998: 594-598
Silvio Lattanzi, D. Sivakumar: Affiliation networks. STOC 2009: 427-434
[taken by Mano Vikash Janardhanan] Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: Stochastic models for the web graph. FOCS 2000: 57-65
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao: Statistical algorithms and a lower bound for detecting planted cliques. STOC 2013: 655-664
[taken by Ben Fish] Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck: Finding overlapping communities in social networks: toward a rigorous approach. EC 2012: 37-54

Random Walks and Markov Chains

Dimitris Bertsimas, Santosh Vempala: Solving convex programs by random walks. J. ACM 51(4): 540-556 (2004)
Fang Chen, László Lovász, Igor Pak: Lifting Markov Chains to Speed up Mixing. STOC 1999: 275-281
[taken by Wei Xing] Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie: Efficient learning of typical finite automata from random walks. STOC 1993: 315-324
Daniel A. Spielman, Nikhil Srivastava: Graph sparsification by effective resistances. STOC 2008: 563-568

Streaming and Sketching Algorithms

Moses Charikar, Liadan O'Callaghan, Rina Panigrahy: Better streaming algorithms for clustering problems. STOC 2003: 30-39
David P. Woodruff: Optimal space lower bounds for all frequency moments. SODA 2004: 167-175
[taken by Anqi Liu] Edo Liberty: Simple and deterministic matrix sketching. KDD 2013: 581-588
Amit Chakrabarti, Graham Cormode, Navin Goyal, Justin Thaler: Annotations for Sparse Data Streams. SODA 2014: 687-706

Clustering and Partitioning

Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Approximate clustering without the approximation. SODA 2009: 1068-1077
Shai Ben-David, Ulrike von Luxburg, Dávid Pál: A Sober Look at Clustering Stability. COLT 2006: 5-19
Frank McSherry: Spectral Partitioning of Random Graphs. FOCS 2001: 529-537
Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5) (2008)
[taken by Adam Lelkes] Noga Alon, Seannie Dar, Michal Parnas, Dana Ron: Testing of Clustering. SIAM J. Discrete Math. 16(3): 393-417 (2003)

Other Topics

[taken by Bowen Dong] Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra: Computing a nonnegative matrix factorization - provably. STOC 2012: 145-162
Nicholas Ruozzi, Sekhar Tatikonda: Message-Passing Algorithms: Reparameterizations and Splittings. IEEE Transactions on Information Theory 59(9): 5860-5881 (2013)
Sanjeev Arora, Rong Ge, Ankur Moitra: Learning Topic Models - Going beyond SVD. FOCS 2012: 1-10
[taken by Yi Huang] Daniel Hsu, Sham M. Kakade, Tong Zhang: A spectral algorithm for learning Hidden Markov Models. J. Comput. Syst. Sci. 78(5): 1460-1480 (2012)