R. Andersen, F. Chung, and K. Lang, Local Graph Partitioning using PageRank Vectors, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.475-486, 2006.
DOI : 10.1109/FOCS.2006.44

R. Andersen and K. J. Lang, Communities from seed sets, Proceedings of the 15th international conference on World Wide Web , WWW '06, pp.223-232, 2006.
DOI : 10.1145/1135777.1135814

L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, Group formation in large social networks, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.44-54, 2006.
DOI : 10.1145/1150402.1150412

V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10008, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

C. Chang, C. Chang, W. Hsieh, D. Lee, L. Liou et al., Abstract, Network Science, vol.2005, issue.04, pp.445-479, 2015.
DOI : 10.1017/nws.2013.2
URL : https://hal.archives-ouvertes.fr/hal-01256309

F. Chung, The heat kernel as the pagerank of a graph, Proceedings of the National Academy of Sciences, pp.19735-19740, 2007.
DOI : 10.1002/rsa.3240040402

F. Chung, A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank, Internet Mathematics, vol.6, issue.3, pp.315-330, 2009.
DOI : 10.1080/15427951.2009.10390643

A. Clauset, Finding local community structure in networks, Physical Review E, vol.35, issue.2, p.26132, 2005.
DOI : 10.1103/PhysRevE.68.036122
URL : http://arxiv.org/pdf/physics/0503036

M. Danisch, J. Guillaume, and B. Le-grand, Learning a proximity measure to complete a community, 2014 International Conference on Data Science and Advanced Analytics (DSAA), pp.90-96, 2014.
DOI : 10.1109/DSAA.2014.7058057
URL : https://hal.archives-ouvertes.fr/hal-01208519

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.33, issue.6, p.66106, 2011.
DOI : 10.1103/PhysRevE.78.046110
URL : https://hal.archives-ouvertes.fr/hal-00661643

M. Ester, H. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Kdd, pp.226-231, 1996.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002
URL : http://arxiv.org/pdf/0906.0612v1.pdf

X. Huang, H. Cheng, L. Qin, W. Tian, and J. X. Yu, Querying k-truss community in large and dynamic graphs, Proceedings of the 2014 ACM SIGMOD international conference on Management of data, SIGMOD '14, pp.1311-1322, 2014.
DOI : 10.1145/2588555.2610495

L. G. Jeub, P. Balachandran, M. A. Porter, P. J. Mucha, and M. W. Mahoney, Think locally, act locally: Detection of small, medium-sized, and large communities in large networks, Physical Review E, vol.106, issue.1, p.12821, 2015.
DOI : 10.1103/PhysRevE.83.025102

K. Kloster and D. F. Gleich, Heat kernel based community detection, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.1386-1395, 2014.
DOI : 10.1145/2623330.2623706
URL : http://arxiv.org/abs/1403.3148

I. M. Kloumann and J. M. Kleinberg, Community membership identification from small seed sets, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.1366-1375, 2014.
DOI : 10.1145/2623330.2623621
URL : http://www.cs.cornell.edu/Info/People/kleinber/kdd14-seed.pdf

A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, Finding Statistically Significant Communities in Networks, PLoS ONE, vol.81, issue.4, p.18961, 2011.
DOI : 10.1371/journal.pone.0018961.s001

J. Leskovec, L. A. Adamic, and B. A. Huberman, The dynamics of viral marketing, ACM Transactions on the Web, vol.1, issue.1, p.5, 2007.
DOI : 10.1145/1232722.1232727

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.695-704, 2008.
DOI : 10.1145/1367497.1367591

Y. Li, K. He, D. Bindel, and J. E. Hopcroft, Uncovering the Small Community Structure in Large Networks, Proceedings of the 24th International Conference on World Wide Web, WWW '15, pp.658-668, 2015.
DOI : 10.1103/PhysRevE.82.066109

M. W. Mahoney, L. Orecchia, and N. K. Vishnoi, A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally, Journal of Machine Learning Research, vol.13, pp.2339-2365, 2012.

A. Mehler and S. Skiena, Expanding network communities from representative examples, ACM Transactions on Knowledge Discovery from Data, vol.3, issue.2, p.7, 2009.
DOI : 10.1145/1514888.1514890
URL : http://www.cs.sunysb.edu/~skiena/lydia/mehler-kdd.pdf

M. E. Newman, Modularity and community structure in networks, Proceedings of the national academy of sciences, pp.8577-8582, 2006.
DOI : 10.1073/pnas.021544898
URL : http://www.pnas.org/content/103/23/8577.full.pdf

L. Orecchia and Z. A. Zhu, Flow-Based Algorithms for Local Graph Clustering, Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp.1267-1286, 2014.
DOI : 10.1137/1.9781611973402.94
URL : http://arxiv.org/abs/1307.2855

P. Pons and M. Latapy, Computing communities in large networks using random walks, International Symposium on Computer and Information Sciences, pp.284-293, 2005.
DOI : 10.1007/11569596_31
URL : http://www.liafa.jussieu.fr/~pons/publi/communities.pdf

F. Reid, A. Mcdaid, and N. Hurley, Partitioning breaks communities, Mining Social Networks and Security Informatics, pp.79-105, 2013.
DOI : 10.1109/asonam.2011.36

M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, pp.1118-1123, 2008.
DOI : 10.1073/pnas.0307852100

M. Sozio and A. Gionis, The community-search problem and how to plan a successful cocktail party, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.939-948, 2010.
DOI : 10.1145/1835804.1835923

D. A. Spielman and S. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.81-90, 2004.
DOI : 10.1145/1007352.1007372
URL : http://arxiv.org/abs/cs/0310051

H. Tong and C. Faloutsos, Center-piece subgraphs, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.404-413, 2006.
DOI : 10.1145/1150402.1150448

R. West, J. Pineau, and D. Precup, Wikispeedia: An online game for inferring semantic distances between concepts, IJCAI, pp.1598-1603, 2009.

J. Xie, S. Kelley, and B. K. Szymanski, Overlapping community detection in networks, ACM Computing Surveys, vol.45, issue.4, p.43, 2013.
DOI : 10.1145/2501654.2501657
URL : http://arxiv.org/pdf/1110.5813

J. Yang and J. Leskovec, Defining and evaluating network communities based on ground-truth, Knowledge and Information Systems, vol.393, issue.3, pp.181-213, 2015.
DOI : 10.1145/2501654.2501657
URL : http://arxiv.org/pdf/1205.6233

H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, Local Higher-Order Graph Clustering, Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , KDD '17, 2017.
DOI : 10.1007/s10115-013-0693-z