1. Zeyuan Allen-Zhu Silvio Lattanzi and Vahab S. Mirrokni. 2013. A local algorithm for finding well-connected clusters. In ICML30th13. 396--404. Zeyuan Allen-Zhu Silvio Lattanzi and Vahab S. Mirrokni. 2013. A local algorithm for finding well-connected clusters. In ICML30th13. 396--404.
2. Noga Alon Chen Avin Michal Koucký Gady Kozma Zvi Lotker and Mark R. Tuttle. 2008. Many random walks are faster than one. In SPAA20th08. 119--128. 10.1145/1378533.1378557 Noga Alon Chen Avin Michal Koucký Gady Kozma Zvi Lotker and Mark R. Tuttle. 2008. Many random walks are faster than one. In SPAA20th08. 119--128. 10.1145/1378533.1378557
3. Luca Becchetti Andrea Clementi Emanuele Natale Francesco Pasquale and Luca Trevisan. 2017. Find your place: Simple distributed algorithms for community detection. In SODA28th17. 940--959. Luca Becchetti Andrea Clementi Emanuele Natale Francesco Pasquale and Luca Trevisan. 2017. Find your place: Simple distributed algorithms for community detection. In SODA28th17. 940--959.
4. Randomized diffusion for indivisible loads
5. Randomized gossip algorithms