G. W. Bush, B. Obama, B. Clinton, R. Reagan, R. Nixon et al.,

A. Ferguson, D. Beckham, D. Pelé, J. Maradona, and .. Mourinho,

A. Lincoln, G. Washington, U. S. Grant, T. Jefferson, and .. Edgar-allan-poe,

W. Madonna, M. Allen, and . Scorsese,

W. A. Mozart, J. S. Bach, L. Van-beethoven, R. Wagner, G. Verdi et al.,

E. Presley, B. Dylan, E. John, D. Bowie, P. Mccartney et al.,

Q. Victoria, . Uk, V. Edward, C. Dickens, . Charles et al.,

J. Sting, R. Nehru, I. Tagore, G. Gandhi, and .. Buddha,

E. England, E. England, H. England, C. England, and .. ,

J. Kemp, B. Favre, P. Manning, W. Camp, T. Brady et al.,

, The 10 largest clusters of Wikipedia Humans among 100 clusters found by Paris. Size Main pages 2722 Barack Obama, vol.4

A. Schwarzenegger, J. Brown, R. Nader, D. Lundgren, E. Warren et al.,

H. Osama-bin-laden, A. Karzai, J. Gonzales, and . Reno, , 2058.

D. D. Eisenhower, H. S. Truman, D. Macarthur, G. S. Patton, C. Lindbergh et al.,

G. W. Bush, C. Rice, C. Powell, D. Rumsfeld, K. Rove et al.,

B. Clinton, T. Marshall, M. Huckabee, J. Roberts, W. Rehnquist et al.,

E. Rendell, A. Specter, and R. Santorum,

T. Roosevelt, H. Hoover, W. H. Taft, C. Coolidge, W. G. Harding et al.,

R. Reagan, R. Nixon, J. Carter, G. Ford, J. E. Hoover et al.,

R. Giuliani, M. Bloomberg, N. Rockefeller, G. Pataki, E. Spitzer et al.,

, Community detection and stochastic block models: recent developments, vol.500, 2017.

. Ahn, Graph sketches: sparsification, spanners, and subgraphs, Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, pp.5-14, 2012.

. Ahn, Link communities reveal multiscale complexity in networks, nature, vol.466, issue.7307, p.761, 2010.

[. Airoldi, Mixed membership stochastic blockmodels, Journal of Machine Learning Research, vol.9, pp.1981-2014, 2008.

L. ;. Andersen, R. Andersen, K. J. Lang, and . Arenas, Analysis of the structure of complex networks at different resolution levels, Proceedings of the 15th international conference on World Wide Web, vol.10, p.53039, 2006.

A. , V. Arthur, D. Vassilvitskii, and S. , k-means++: The advantages of careful seeding, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1027-1035, 2007.

[. Backstrom, Group formation in large social networks: membership, growth, and evolution, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.44-54, 1997.

. Bar-yossef, Reductions in streaming algorithms, with an application to counting triangles in graphs, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.623-632, 2002.

[. Barabási, A. ;. Barabási, A. Albert, and R. , Emergence of scaling in random networks, science, vol.286, issue.5439, pp.509-512, 1999.

[. Barabási, Approximating st minimum cuts in õ (n 2) time, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp.47-55, 1996.

. Benson, Higher-order organization of complex networks, Science, vol.353, issue.6295, pp.163-166, 2016.

J. Benzécri, Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques, Les cahiers de l'analyse des données, vol.7, pp.209-218, 1982.

J. C. Bezdek, Objective function clustering, Pattern recognition with fuzzy objective function algorithms, pp.43-93, 1981.

. Blondel, Fast unfolding of communities in large networks, Journal of statistical mechanics: theory and experiment, issue.10, p.10008, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01146070

[. Bonald, Hierarchical graph clustering by node pair sampling, 2018.

[. Bonald, Forward and backward embedding of directed graphs, 2018.

[. Bonald, Weighted spectral embedding of graphs, Communication, Control, and Computing (Allerton), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01887680

. Brandes, On finding graph clusterings with maximum modularity, In International Workshop on Graph-Theoretic Concepts in Computer Science, vol.36, issue.suppl_1, pp.637-640, 2007.

[. Buriol, Counting triangles in data streams, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp.253-262, 2006.

[. Chang, Exponentially twisted sampling for centrality analysis and community detection in attributed networks, IEEE Transactions on Network Science and Engineering, 2018.

[. Chang, Relative centrality and local community detection, Network Science, vol.3, issue.4, pp.445-479, 2015.

[. Chang, A general probabilistic framework for detecting community structure in networks, INFOCOM, pp.730-738, 2011.

[. Chang, A probabilistic framework for structural analysis and community detection in directed networks, IEEE/ACM Transactions on Networking (TON), vol.26, issue.1, pp.31-46, 2018.

C. Chang and C. Chang, A unified framework for sampling, clustering and embedding data points in semi-metric spaces, 2017.

F. Chung-;-chung, The heat kernel as the pagerank of a graph, Proceedings of the National Academy of Sciences, vol.104, issue.50, pp.19735-19740, 2007.

F. Chung-;-chung, A local graph partitioning algorithm using heat kernel pagerank, Internet Mathematics, vol.6, issue.3, pp.315-330, 2009.

F. R. Chung, Finding local community structure in networks, Physical review E, vol.72, issue.2, p.26132, 1997.

[. Clauset, Hierarchical structure and the prediction of missing links in networks, Nature, vol.453, issue.7191, p.98, 2008.

[. Danisch, Learning a proximity measure to complete a community, Data Science and Advanced Analytics (DSAA), 2014 International Conference on, pp.90-96, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01208519

W. H. Day and H. Edelsbrunner, Efficient algorithms for agglomerative hierarchical clustering methods, Journal of classification, vol.1, issue.1, pp.7-24, 1984.

[. Decelle, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.84, issue.6, p.66106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00661643

[. Delvenne, Stability of graph communities across time scales, Proceedings of the national academy of sciences, vol.107, pp.12755-12760, 2010.

. Donetti, L. Munoz-;-donetti, and M. A. Munoz, Detecting network communities: a new systematic and efficient algorithm, Journal of Statistical Mechanics: Theory and Experiment, issue.10, p.10012, 2004.

[. Duchi, Efficient projections onto the l 1-ball for learning in high dimensions, Proceedings of the 25th international conference on Machine learning, pp.272-279, 2008.

J. C. Dunn-;-dunn, A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters, 1973.

M. Elkin and J. Zhang, Efficient algorithms for constructing (1+ , ?)-spanners in the distributed and streaming models, Distributed Computing, vol.18, issue.5, pp.375-385, 2006.

[. Epasto, Efficient densest subgraph computation in evolving graphs, Proceedings of the 24th International Conference on World Wide Web, pp.300-310, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01699042

D. Eppstein-;-eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs, Journal of Experimental Algorithmics (JEA), vol.5, p.1, 2000.

[. Ester, A density-based algorithm for discovering clusters in large spatial databases with noise, vol.96, pp.226-231, 1996.

L. Evans, T. Evans, and R. Lambiotte, Line graphs, link partitions, and overlapping communities, Physical Review E, vol.80, issue.1, p.16105, 2009.

[. Feigenbaum, On graph problems in a semi-streaming model, Theoretical Computer Science, vol.348, issue.2-3, pp.207-216, 2005.

S. Fortunato, Community detection in graphs, Physics reports, vol.486, issue.3, pp.75-174, 2010.

. Fortunato, S. Barthelemy-;-fortunato, and M. Barthelemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, vol.104, issue.1, pp.36-41, 2007.

. Fortunato, S. Castellano-;-fortunato, and C. Castellano, Community structure in graphs, Computational Complexity, pp.490-512, 2012.

. Fowlkes, Spectral grouping using the nystrom method. IEEE transactions on pattern analysis and machine intelligence, vol.26, pp.214-225, 2004.

. Frieze, A. Karo?ski-;-frieze, and M. Karo?ski, Introduction to random graphs, 2016.

[. Garey, The complexity of the generalized lloyd-max problem (corresp.), IEEE Transactions on Information Theory, vol.28, issue.2, pp.255-256, 1982.

[. Gauvin, Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach, PloS one, vol.9, issue.1, p.86028, 2014.

. Girvan, M. Newman-;-girvan, and M. E. Newman, Community structure in social and biological networks, Proceedings of the national academy of sciences, vol.99, pp.7821-7826, 2002.

D. F. Gleich, Pagerank beyond the web, SIAM Review, vol.57, issue.3, pp.321-363, 2015.

[. Goel, On the communication and streaming complexity of maximum bipartite matching, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pp.468-485, 2012.

A. A. Goldstein, Convex programming in hilbert space, Bulletin of the American Mathematical Society, vol.70, issue.5, pp.709-710, 1964.

E. Griechisch and A. Pluhár, Community detection by using the extended modularity, Acta Cybern, vol.20, issue.1, pp.69-85, 2011.

[. Grover, A. Grover, and J. Leskovec, node2vec: Scalable feature learning for networks, Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp.855-864, 2016.

[. Guimera, Modularity from fluctuations in random graphs and complex networks, Physical Review E, vol.70, issue.2, p.25101, 2004.

[. Hassan, Extracting diseasesymptom relationships by learning syntactic patterns from dependency graphs, p.184, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01184655

. Havens, A soft modularity function for detecting fuzzy communities in social networks, IEEE Transactions on Fuzzy Systems, vol.21, issue.6, pp.1170-1175, 2013.

[. Heimlicher, Community detection in the labelled stochastic block model, 2012.

[. Holland, Stochastic blockmodels: First steps, Social networks, vol.5, issue.2, pp.109-137, 1983.

[. Hollocou, Multiple local community detection, ACM SIGMETRICS Performance Evaluation Review, vol.45, issue.2, pp.76-83, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01625444

[. Hollocou, Modularity-based sparse soft graph clustering, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02005331

[. Hollocou, A fast agglomerative algorithm for edge clustering, 2018.

[. Hollocou, A streaming algorithm for graph clustering, NIPS Workshop, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01639506

[. Huang, Shrink: a structural clustering algorithm for detecting hierarchical communities in networks, Proceedings of the 19th ACM international conference on Information and knowledge management, pp.219-228, 2010.

[. Huang, Querying k-truss community in large and dynamic graphs, Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp.1311-1322, 2014.

[. Jeub, Think locally, act locally: Detection of small, medium-sized, and large communities in large networks, Physical Review E, vol.91, issue.1, p.12821, 2015.

J. Juan-;-juan, Programme de classification hiérarchique par l'algorithme de la recherche en cha?ne des voisins réciproques. Les Cahiers de l'Analyse des, Données, vol.7, issue.2, pp.219-225, 1982.

. Karrer, B. Newman-;-karrer, and M. E. Newman, Stochastic blockmodels and community structure in networks, Physical review E, vol.83, issue.1, p.16107, 2011.

L. Kaufman and P. Rousseeuw, Clustering by means of medoids, 1987.

[. Kawase, Additive approximation algorithms for modularity maximization, 2016.

J. M. Kleinberg, An impossibility theorem for clustering, Advances in neural information processing systems, pp.463-470, 2003.

[. Kloster, K. Gleich-;-kloster, and D. F. Gleich, Heat kernel based community detection, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.1386-1395, 2014.

. Kloumann, I. M. Kleinberg-;-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, pp.1366-1375, 2014.

[. Lambiotte, Laplacian dynamics and multiscale modular structure in networks, 2008.

[. Lambiotte, Random walks, markov processes and the multiscale modular organization of complex networks, IEEE Trans. Network Science and Engineering, vol.1, issue.2, pp.76-90, 2014.

F. Lancichinetti, A. Lancichinetti, and S. Fortunato, Community detection algorithms: a comparative analysis, Physical review E, vol.80, issue.5, p.56117, 2009.

[. Lancichinetti, Detecting the overlapping and hierarchical community structure in complex networks, New Journal of Physics, vol.11, issue.3, p.33015, 2009.

[. Lancichinetti, Benchmark graphs for testing community detection algorithms, Physical review E, vol.78, issue.4, p.46110, 2008.

[. Lancichinetti, Finding statistically significant communities in networks, PloS one, vol.6, issue.4, p.18961, 2011.

C. Lanczos-;-lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, Advances in neural information processing systems, pp.556-562, 1950.
URL : https://hal.archives-ouvertes.fr/hal-01712947

[. Lelarge, Reconstruction in the labelled stochastic block model, IEEE Transactions on Network Science and Engineering, vol.2, issue.4, pp.152-163, 2015.

[. Leskovec, The dynamics of viral marketing, ACM Transactions on the Web (TWEB), vol.1, issue.1, p.5, 2007.

[. Leskovec, Statistical properties of community structure in large social and information networks, Proceedings of the 17th international conference on World Wide Web, pp.695-704, 2008.

M. Leskovec, J. Leskovec, and J. J. Mcauley, Learning to discover social circles in ego networks, Advances in neural information processing systems, pp.539-547, 2012.

P. Levitin, E. S. Levitin, and B. T. Polyak, Constrained minimization methods. USSR Computational mathematics and mathematical physics, vol.6, pp.1-50, 1966.

[. Li, Uncovering the small community structure in large networks: A local spectral approach, Proceedings of the 24th international conference on world wide web, pp.658-668, 2015.

C. Lin-;-lin, Projected gradient methods for nonnegative matrix factorization, Neural computation, vol.19, issue.10, pp.2756-2779, 2007.

S. Lloyd-;-lloyd, Least squares quantization in pcm, IEEE transactions on information theory, vol.28, issue.2, pp.129-137, 1982.

[. Lovász, Random walks on graphs: A survey, Combinatorics, Paul erdos is eighty, vol.2, issue.1, pp.1-46, 1993.

[. Lyzinski, Community detection and classification in hierarchical stochastic blockmodels, IEEE Transactions on Network Science and Engineering, vol.4, issue.1, pp.13-26, 2017.

[. Mahajan, The planar k-means problem is np-hard, International Workshop on Algorithms and Computation, pp.274-285, 2009.

[. Mahoney, 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.

[. Mcdaid, Normalized mutual information to evaluate overlapping community finding algorithms, 2011.

A. Mcgregor-;-mcgregor, Graph stream algorithms: a survey, ACM SIGMOD Record, vol.43, issue.1, pp.9-20, 2014.

A. Mehler and S. Skiena, Expanding network communities from representative examples, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.3, issue.2, p.7, 2009.

[. Mikolov, Efficient estimation of word representations in vector space, 2013.

[. Mislove, Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp.29-42, 2007.

R. ;. Molloy, M. Molloy, and B. Reed, A critical point for random graphs with a given degree sequence. Random structures & algorithms, vol.6, pp.161-180, 1995.

C. Murtagh, F. Murtagh, and P. Contreras, Algorithms for hierarchical clustering: an overview, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol.2, issue.1, pp.86-97, 2012.

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical review E, vol.69, issue.6, p.66133, 2004.

M. E. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical review E, vol.74, issue.3, p.36104, 2006.

M. E. Newman, Equivalence between modularity optimization and maximum likelihood methods for community detection, Physical Review E, vol.94, issue.5, p.52315, 2016.

C. Newman, M. E. Newman, and A. Clauset, Structure and inference in annotated networks, Nature communications, vol.7, p.11863, 2016.

. Newman, M. E. Girvan-;-newman, and M. Girvan, Finding and evaluating community structure in networks, Physical review E, vol.69, issue.2, p.26113, 2004.

. Ng, On spectral clustering: Analysis and an algorithm, Advances in neural information processing systems, pp.849-856, 2002.

[. Nicosia, Extending the definition of modularity to directed graphs with overlapping communities, Journal of Statistical Mechanics: Theory and Experiment, issue.03, p.3024, 2009.

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.

[. Page, The pagerank citation ranking: Bringing order to the web, 1999.

[. Panzarasa, Patterns and dynamics of users' behavior and interaction: Network analysis of an online community, Journal of the American Society for Information Science and Technology, vol.60, issue.5, pp.911-932, 2009.

[. Peel, The ground truth about metadata and community detection in networks, Science advances, vol.3, issue.5, p.1602548, 2017.

[. Perozzi, Deepwalk: Online learning of social representations, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.701-710, 2014.

O. Perron-;-perron, Grundlagen für eine theorie des jacobischen kettenbruchalgorithmus, Mathematische Annalen, vol.64, issue.1, pp.1-76, 1907.

P. Pons and M. Latapy, Computing communities in large networks using random walks, International Symposium on Computer and Information Sciences, pp.284-293, 2005.

. Prat-pérez, High quality, scalable and parallel community detection for large real graphs, Proceedings of the 23rd international conference on World wide web, pp.225-236, 2014.

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Physical Review E, vol.74, issue.1, p.16110, 2006.

[. Reid, Partitioning breaks communities, Mining Social Networks and Security Informatics, pp.79-105, 2013.

P. Ronhovde, Z. Nussinov, M. Rosvall, and C. T. Bergstrom, Multiresolution community detection for megascale networks by information-based replica correlations, Proceedings of the National Academy of Sciences, vol.80, issue.1, pp.1118-1123, 2008.

[. Rosvall, Memory in network flows and its effects on spreading dynamics and community detection, Nature communications, vol.5, p.4630, 2014.

[. Saade, Spectral clustering of graphs with the bethe hessian, Advances in Neural Information Processing Systems, pp.406-414, 2014.
URL : https://hal.archives-ouvertes.fr/cea-01140852

. Sales-pardo, Extracting the hierarchical organization of complex systems, Proceedings of the National Academy of Sciences, vol.104, issue.39, pp.15224-15229, 2007.

[. Schaub, The many facets of community detection in complex networks, Applied Network Science, vol.2, issue.1, p.4, 2017.

[. Shi, A link clustering based overlapping community detection algorithm, Data & Knowledge Engineering, vol.87, pp.394-404, 2013.

M. ;. Shi, J. Shi, and J. Malik, Normalized cuts and image segmentation, IEEE Transactions, vol.22, issue.8, pp.888-905, 2000.

E. H. Simpson-;-simpson, 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, pp.939-948, 1949.

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, pp.81-90, 2004.

. Sylvester and J. J. Sylvester, Xix. a demonstration of the theorem that every homogeneous quadratic polynomial is reducible by real orthogonal substitutions to the form of a sum of positive and negative squares, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, vol.4, issue.23, pp.138-142, 1852.

[. Tang, International World Wide Web Conferences Steering Committee, Proceedings of the 24th International Conference on World Wide Web, pp.1067-1077, 1983.

H. Tong and C. Faloutsos, Center-piece subgraphs: problem definition and fast solutions, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.404-413, 2006.

B. Tremblay, N. Tremblay, and P. Borgnat, Graph wavelets for multiscale community mining, IEEE Transactions on Signal Processing, vol.62, issue.20, pp.5227-5239, 2014.

U. [von-luxburg-;-von-luxburg, A tutorial on spectral clustering, Statistics and computing, vol.17, issue.4, pp.395-416, 2007.

[. Ward and J. H. Ward, Hierarchical grouping to optimize an objective function, Journal of the American statistical association, vol.58, issue.301, pp.236-244, 1963.

[. West, R. West, J. Leskovec, and . West, Wikispeedia: An online game for inferring semantic distances between concepts, Proceedings of the 21st international conference on World Wide Web, pp.1598-1603, 2009.

[. Whang, Non-exhaustive, overlapping k-means, Proceedings of the 2015 SIAM International Conference on Data Mining, pp.936-944, 2015.

[. Xie, Overlapping community detection in networks: The state-of-the-art and comparative study, Acm computing surveys (csur), vol.45, issue.4, p.43, 2013.

Y. , L. Yang, J. Leskovec, and J. , Overlapping community detection at scale: a nonnegative matrix factorization approach, Proceedings of the sixth ACM international conference on Web search and data mining, pp.587-596, 2013.

Y. , L. Yang, J. Leskovec, and J. , Defining and evaluating network communities based on ground-truth, Knowledge and Information Systems, vol.42, issue.1, pp.181-213, 2015.

[. Yang, Community detection in networks with node attributes, Data Mining (ICDM), 2013 IEEE 13th international conference on, pp.1151-1156, 2013.