, the community size distribution?

, Is there any fitness function that should be optimized?

, The experiments and results in this chapter could help to identify quickly suitable method(s) if one is able to response the previous questions. Even still very far from being an exclusive analysis, our experiments cover a wide range of popular aspects of community structure that are studied in the state-of-the-art. Some primary conclusions that could be extracted from the analyses in this chapter can be cited: ? A consideration of computation time is very crucial in the process of choosing a community detection method for a problem at hand. As such, a well performed method in the literature can help one to reduce approximately 10 4 times of required computation time, which is significantly important in discovering large graph. Theoretical estimate of time complexity is important and reveals the scalability of a community detection method. On the other hand

S. Agreste, P. De-meo, G. Fiumara, G. Piccione, S. Piccolo et al., An Empirical Comparison of Algorithms to Find Communities in Directed Graphs and Their Application in Web Data Analytics, pp.289-306, 2017.

R. Albert, H. Jeong, and A. Barabási, Internet: Diameter of the WorldWide Web, Nature, vol.401, pp.130-131, 1999.

R. Aldecoa and I. Marín, Deciphering Network Community Structure by Surprise, PLoS ONE 6.9, 2011.

L. A. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, Classes of smallworld networks, Proceedings of the National Academy of Sciences 97.21, pp.11149-11152, 2000.

B. P. Ames, Guaranteed clustering and biclustering via semidefinite programming, Mathematical Programming, vol.147, pp.429-465, 2013.

L. N. Ana and A. K. Jain, Robust data clustering, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Proceedings. DOI: 10.1109/ cvpr.2003.1211462, 2003.

. Andrei, K. Broder, M. Ravi, R. Farzin, R. Prabhakar et al., Graph structure in the Web, Computer Networks 33.1, pp.83-92, 2000.

S. Arifin, R. Zulkardi, Y. Putri, E. Hartono, and . Susanti, Developing Illdefined problem-solving for the context of South Sumatera, Journal of Physics: Conference Series 943, p.12038, 2017.

A. Barabási and R. Albert, Emergence of Scaling in Random Networks, Science 286, vol.5439, pp.509-512, 1999.

A. Barrat and M. Weigt, On the properties of small-world network models, European Physical Journal B, vol.13, pp.547-560, 2000.

A. Barrat, M. Barthélemy, R. Pastor-satorras, and A. Vespignani, The architecture of complex weighted networks, Proceedings of the National Academy of Sciences, vol.101, pp.3747-3752, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00013475

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

L. Bohlin, D. Edler, A. Lancichinetti, and M. Rosvall, Community Detection and Visualization of Networks with the Map Equation Framework, Measuring Scholarly Impact, pp.3-34, 2014.

A. Bosch, T. Van-den, M. Bogers, and . De-kunder, Estimating search engine index size variability: a 9-year longitudinal study, 2016.

C. Bothorel, J. D. Cruz, M. Magnani, and B. Mickeková, Clustering attributed graphs: Models, measures and methods, Network Science 3.03, pp.408-444, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257833

U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer et al., On Modularity Clustering, IEEE Transactions on Knowledge and Data Engineering, vol.20, pp.172-188, 2008.

U. Brandes, A faster algorithm for betweenness centrality, The Journal of Mathematical Sociology, vol.25, pp.163-177, 2001.

A. Brun and A. Boyer, Détection de communautés d'intérêt et recommandation sociale par leaders, Ingénierie des systèmes d'information 17, vol.6, pp.91-113, 2012.

R. Burt, Structural holes : the social structure of competition, p.9780674843714, 1992.

P. Cano, O. Celma, M. Koppenberger, and J. M. Buldú, Topology of music recommendation networks, Chaos 16.1, p.13107, 2006.

T. Chakraborty, A. Dalmia, A. Mukherjee, and N. Ganguly, Metrics for Community Analysis: A Survey, In: ACM Comput. Surv, vol.50, pp.1-37, 2017.

S. Chaoming, H. Shlomo, M. Hernán, and A. , Self-similarity of complex networks, 2005.

A. Clauset, C. R. Shalizi, and M. E. Newman, Power-law distributions in empirical data, SIAM Review 51, 2009.

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, 2004.

W. S. Cleveland, Robust Locally Weighted Regression and Smoothing Scatterplots, Journal of the American Statistical Association, vol.74, pp.829-836, 1979.

,

T. H. Cormen, E. Charles, R. L. Leiserson, S. Rivest, and . Clifford, Introduction to algorithms, pp.978-978, 2009.

C. Cortes, D. Pregibon, and C. Volinsky, Communities of Interest, Advances in Intelligent Data Analysis, pp.978-981, 2001.

M. Coscia, F. Giannotti, and D. Pedreschi, A classification for community discovery methods in complex networks, Statistical Analysis and Data Mining 4.5, pp.512-546, 2011.

J. Creusefond, T. Largillier, and S. Peyronnet, Finding compact communities in large graphs, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 -ASONAM 15, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01149820

J. Creusefond, T. Largillier, and S. Peyronnet, On the Evaluation Potential of Quality Functions in Community Detection for Different Contexts, Advances in Network Science, pp.111-125, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01652600

E. M. Daly, W. Geyer, and D. R. Millen, The Network Effects of Recommending Social Connections, Proceedings of the Fourth ACM Conference on Recommender Systems. RecSys '10, pp.301-304, 2010.

L. Danon, A. Díaz-guilera, J. Duch, and A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, vol.09, pp.9008-09008, 2005.

. Dao, C. Vinh-loc, P. Bothorel, and . Lenca, Community detection methods can discover better structural clusters than ground-truth communities, Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 -ASONAM 17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01577343

. Dao, C. Vinh-loc, P. Bothorel, and . Lenca, Community Structures Evaluation in Complex Networks: A Descriptive Approach, 3rd International Winter School and Conference on Network Science, pp.11-19, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01513246

. Dao, C. Vinh-loc, P. Bothorel, and . Lenca, An empirical characterization of community structures in complex networks using a bivariate map of quality metrics, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01809064

. Dao, C. Vinh-loc, P. Bothorel, and . Lenca, Community structure: A comparative evaluation of community detection methods, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01976587

. Dao, C. Vinh-loc, P. Bothorel, and . Lenca, Estimating the similarity of community detection methods based on cluster size distribution, The 7th International Conference on Complex Networks and Their Applications, vol.812, pp.183-194, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01911077

A. Davis, B. Burleigh, M. R. Gardner, and . Gardner, Deep South, a social anthropological study of caste and class, 1941.

E. W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numer. Math. 1, vol.1, pp.269-271, 1959.

S. Dongen and . Van, A Cluster Algorithm for Graphs, 2000.

S. N. Dorogovtsev and J. F. Mendes, Evolution of networks, Advances in Physics, vol.51, pp.1079-1187, 2002.

J. Duch and A. Arenas, Community detection in complex networks using extremal optimization, 2005.

J. Eckmann, E. Moses, and D. Sergi, Entropy of dialogues creates coherent structures in e-mail traffic, Proceedings of the National Academy of Sciences 101.40, pp.14333-14337, 2004.

P. Elias, A. Feinstein, and C. Shannon, A note on the maximum flow through a network, IEEE Transactions on Information Theory 2.4, pp.117-119, 1956.

P. Erd?-os and A. Rényi, On random graphs, I, Publicationes Mathematicae (Debrecen) 6, pp.1959-1970, 1959.

R. Erzsébet and B. Albert-lászló, Hierarchical organization in complex networks, Physical Review E, vol.67, 2003.

E. Estrada, Quantifying network heterogeneity". In: Physical Review E 82, 2010.

E. Estrada, D. J. Higham, and N. Hatano, Communicability betweenness in complex networks, Physica A: Statistical Mechanics and its Applications, vol.388, pp.764-774, 2009.

E. Estrada, The structure of complex networks: Theory and applications, 2011.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On Powerlaw Relationships of the Internet Topology, SIGCOMM Comput, vol.29, pp.251-262, 1999.

M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, vol.3, 1973.

M. Flaviano, M. Byungjoon, B. Lin, M. Romain, and A. Makse-hernán, Collective Influence Algorithm to find influencers via optimal percolation in massively large social media, Scientific Reports 6.1. DOI: 10 . 1038 / srep30062, 2016.

S. Fortunato and M. Barthelemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences 104.1, pp.36-41, 2006.

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

S. Fortunato and D. Hric, Community detection in networks: A user guide, Physics Reports, vol.659, pp.1-44, 2016.

F. Fouss, A. Pirotte, J. Michel-renders, and M. Saerens, Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation, IEEE Transactions on Knowledge and Data Engineering, vol.19, pp.355-369, 2007.

F. Francois, P. Alain, R. Jean-michel, and S. Marco, A Novel Way of Computing Dissimilarities between Nodes of a Graph, with Application to Collaborative Filtering, Workshop on Statistical Approaches for Web Mining, 2004.

L. C. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry 40.1, p.35, 1977.

A. Fronczak, P. Fronczak, and J. A. Ho?yst, Mean-field theory for clustering coefficients in Barabási-Albert networks, 2003.

T. M. Fruchterman and E. M. Reingold, Graph Drawing by Force-directed Placement, In: Softw. Pract. Exper. 21, vol.11, pp.1129-1164, 1991.

A. Ghasemian, H. Hosseinmardi, and A. Clauset, Evaluating Overfit and Underfit in Models of Network Community Structure". In: ArXiv e-prints, 2018.

E. N. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, pp.1141-1144, 1959.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences 99.12, pp.7821-7826, 2002.

O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.444-451, 1988.

M. C. González, A. César, A. Hidalgo, and . Barabási, Understanding individual human mobility patterns, Nature 453, vol.7196, pp.779-782, 2008.

R. A. Green, A high-resolution C. elegans essential gene network based on phenotypic profiling of a complex tissue, p.45, 2011.

R. Guimerà, M. Sales-pardo, and L. A. Amaral, Modularity from fluctuations in random graphs and complex networks, Phys. Rev. E, vol.70, p.25101, 2004.

R. Guimerà and M. Sales-pardo, Missing and spurious interactions and the reconstruction of complex networks, Proceedings of the National Academy of Sciences 106.52, pp.22073-22078, 2009.

R. Guimerà, M. Sales-pardo, A. N. Luís, and . Amaral, Classes of complex networks defined by role-to-role connectivity profiles, Nature Physics 3.1, pp.63-69, 2006.

Z. Haijun and L. Reinhard, Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Sub-communities, International Conference on Computational Science, 2004.

D. Harel and Y. Koren, On Clustering Using Random Walks, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, pp.18-41, 2001.

T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, 2009.

T. Hastie, R. Tibshirani, and J. Friedman, Unsupervised Learning -The Elements of Statistical Learning, pp.485-585, 2009.

J. Hizanidis, N. E. Kouvaris, G. Zamora-lópez, A. Diaz-guilera, and C. G. Antonopoulos, Chimera-like States in Modular Neural Networks, Scientific Reports, 2016.

. Hric, R. K. Darko, S. Darst, and . Fortunato, Community detection in networks: Structural communities versus ground truth, 2014.

L. Hubert and P. Arabie, Comparing partitions, Journal of Classification 2.1, pp.193-218, 1985.

H. Jeong, S. P. Mason, A. Barabási, and Z. N. Oltvai, Lethality and centrality in protein networks, Nature, vol.411, pp.41-42, 2001.

K. Jerome, The Koblenz Network Collection, Proceedings Conference on World Wide Web Companion, pp.1343-1350, 2013.

J. H. Ward, Hierarchical Grouping to Optimize an Objective Function, Journal of the American Statistical Association, vol.58, pp.236-244, 1963.

B. Karrer and M. E. Newman, Stochastic blockmodels and community structure in networks, Physical Review E, 2011.

L. Katz, A new status index derived from sociometric analysis, DOI: 10 . 1007 / bf02289026, pp.39-43, 1953.

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, pp.291-307, 1970.

L. Kevin, K. Jason, and C. Nicholas, The Taste for Privacy: An Analysis of College Student Privacy Settings in an Online Social Network, In: Journal of Computer-Mediated Communication, vol.14, issue.1, pp.79-100, 2008.

B. S. Khan and M. A. Niazi, Network Community Detection: A Review and Visual Survey". In: ArXiv e-prints, 2017.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science 220, vol.4598, pp.671-680, 1983.

J. M. Kleinberg, R. Kumar, P. Raghavan, A. S. Sridhar-rajagopalan, and . Tomkins, The Web As a Graph: Measurements, Models, and Methods, Proceedings of the 5th Annual International Conference on Computing and Combinatorics. COCOON'99, pp.3-540, 1999.

K. Klemm and V. M. Eguíluz, Growing scale-free networks with small-world behavior, Physical Review E, 2002.

S. Kullback and R. A. Leibler, On Information and Sufficiency, The Annals of Mathematical Statistics 22.1, pp.79-86, 1951.

L. I. Kuncheva and S. T. Hadjitodorov, Using diversity in cluster ensembles, IEEE International Conference on Systems, Man and Cybernetics, 2004.

V. Labatut and G. K. Orman, Community Structure Characterization, Encyclopedia of Social Network Analysis and Mining, pp.1-13, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01525440

R. Lambiotte, Multi-scale modularity in complex networks, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, pp.546-553, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00492050

A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark graphs for testing community detection algorithms, 2008.

A. Lancichinetti, M. Kivelä, J. Saramäki, and S. Fortunato, Characterizing the Community Structure of Complex Networks, PLoS ONE 5.8. Ed. by Olaf Sporns, 2010.

A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, Finding Statistically Significant Communities in Networks, PLoS ONE, 2011.

C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, Journal of Research of the National Bureau of Standards 45, vol.4, p.255, 1950.
URL : https://hal.archives-ouvertes.fr/hal-01712947

L. László, Random Walks on Graphs: A Survey, Combinatorics, Paul Er? os is Eighty, vol.2, pp.1-46, 1993.

E. A. Leicht, M. E. Petter-holme, and . Newman, Vertex similarity in networks, 2006.

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph Evolution: Densification and Shrinking Diameters, ACM Transactions on Knowledge Discovery from Data, 2007.

J. Leskovec and A. Krevl, SNAP Datasets: Stanford Large Network Dataset Collection, 2014.

. Leskovec, K. J. Jure, A. Lang, M. W. Dasgupta, and . Mahoney, Statistical properties of community structure in large social and information networks, Proceeding of the 17th international conference on World Wide, 2008.

Z. Li, S. Zhang, R. Wang, X. Zhang, and L. Chen, Quantitative function for community detection, 2008.

U. Lichtenberg, L. J. De, S. Jensen, P. Brunak, and . Bork, Dynamic Complex Formation During the Yeast Cell Cycle, Science 307, vol.5710, pp.36-8075, 2005.

D. Magoni and J. J. Pansiot, Analysis of the Autonomous System Network Topology, SIGCOMM Comput, vol.3, pp.146-4833, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00344478

F. D. Malliaros and M. Vazirgiannis, Clustering and community detection in directed networks: A survey, Physics Reports, vol.533, pp.95-142, 2013.

K. Marcus, Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks, New Journal of Physics, vol.10, p.83042, 2008.

M. Mary, A. Leman, and F. Christos, Statistical Properties of Social Networks, Social Network Data Analytics, pp.17-42, 2011.

N. Masuda and R. Lambiotte, A Guide to Temporal Networks, WORLD SCIENTIFIC (EUROPE, 2016.

J. Matthew, Social and economic networks, pp.978-0691148205, 2008.

A. Mccallum, X. Wang, and A. Corrada-emmanuel, Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email, Journal of Artificial Intelligence Research, vol.30, pp.1076-9757, 2007.

, Comparing Clusterings by the Variation of Information, Learning Theory and Kernel Machines, pp.173-187, 2003.

P. Meo, E. De, G. Ferrara, A. Fiumara, and . Provetti, Mixing local and global information for community detection in large networks, Journal of Computer and System Sciences, vol.80, issue.1, pp.72-87, 2014.

G. Miritello, R. Lara, M. Cebrian, and E. Moro, Limited communication capacity unveils strategies for human interaction, Scientific Reports, 2013.

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, 2007.

A. Miyauchi and Y. Kawase, Z-Score-Based Modularity for Community Detection in Networks, PLOS ONE 11.1. Ed. by Frederic Amblard, 2016.

J. Moreno, H. H. Levy, and . Jennings, Who shall survive?: A new approach to the problem of human interrelations, 1934.

B. Nadler, S. Lafon, R. R. Coifman, and I. G. Kevrekidis, Diffusion maps, spectral clustering and reaction coordinates of dynamical systems, Applied and Computational Harmonic Analysis 21.1, pp.113-127, 2006.

M. C. Nascimento, C. P. André, and . De-carvalho, Spectral methods for graph clustering -A survey, European Journal of Operational Research, vol.211, pp.221-231, 2011.

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, 2001.

M. E. Newman, The structure of scientific collaboration networks, Proceedings of the National Academy of Sciences 98, pp.404-409, 2001.

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, pp.167-256, 2003.

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, 2004.

M. E. Newman, Power laws, Pareto distributions and Zipf's law, Contemporary Physics, vol.46, pp.323-351, 2005.

M. E. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences 103.23, pp.27-8424, 2006.

M. E. Newman, Mathematics of Networks, The New Palgrave Dictionary of Economics, pp.1-8, 2008.

M. E. Newman, Networks: An Introduction, 2010.

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, 2004.

J. Nils, Analyzing protein-protein interactions in the post-interactomic era. Are we ready for the endgame?, pp.6-291, 2014.

J. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, D. Lazer et al., Structure and tie strengths in mobile communication networks, Proceedings of the National Academy of Sciences 104.18, pp.27-8424, 2007.

G. Orman, V. Keziban, H. Labatut, and . Cherifi, Comparative evaluation of community detection algorithms: a topological approach, Journal of Statistical Mechanics: Theory and Experiment, vol.08, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00710659

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, 1998.

S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos, Community detection in Social Media, Data Mining and Knowledge Discovery, vol.24, pp.515-554, 2011.

S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos, Community Detection in Social Media, Data Min. Knowl. Discov, vol.24, issue.3, pp.515-554, 2012.

. Pareto, ;. Vilfredo, A. Romualdo, and . Vespignani, Cours d'Économie Politique. Librairie Droz, Geneva. Pastor-Satorras, Evolution and Structure of the Internet: A Statistical Physics Approach, p.521826985, 1964.

. Peel, D. B. Leto, A. Larremore, and . Clauset, The ground truth about metadata and community detection in networks, Science Advances 3.5, 2017.

T. P. Peixoto, Bayesian stochastic blockmodeling, Advances in Network Clustering and Blockmodeling, 2018.

P. Pons and M. Latapy, Computing Communities in Large Networks Using Random Walks, Computer and Information Sciences -ISCIS 2005. Ed. by pInar Yolum, Tunga Güngör, Fikret Gürgen, and Can Özturan, pp.978-981, 2005.

P. Pons and M. Latapy, Post-processing hierarchical community structures: Quality improvements and multi-scale view, Theoretical Computer Science 412.8-10, pp.892-900, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01146086

S. Porta, P. Crucitti, and V. Latora, The Network Analysis of Urban Streets: A Dual Approach, Science, vol.369, issue.2, 2006.

M. A. Porter, J. Onnela, and P. J. Mucha, Communities in Networks". In: Notices of the American Mathematical Society, vol.9, 2009.

A. Pothen, H. D. Simon, and K. Liou, Partitioning Sparse Matrices with Eigenvectors of Graphs, In: SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.5-8580, 1957.

M. G. Rabbat, J. R. Treichler, S. L. Wood, and M. G. Larimore, Understanding the topology of a telephone network via internally-sensed network tomography, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.3, 2005.

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks, Proceedings of the National Academy of Sciences, vol.101, pp.2658-2663, 2004.

U. Raghavan, R. Nandini, S. Albert, and . Kumara, Near linear time algorithm to detect community structures in large-scale networks, 2007.

W. M. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.66, pp.846-850, 1971.

E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabasi, Hierarchical organization of modularity in metabolic networks, pp.297-5586, 2002.

J. Reichardt, R. Alamino, and D. Saad, The Interplay between Microscopic and Mesoscopic Structures in Complex Networks, PLoS ONE 6.8. Ed. by Olaf Sporns, 2011.

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, 2006.

M. A. Riolo, T. George, G. Cantwell, M. E. Reinert, and . Newman, Efficient method for estimating the number of communities in a network, 2017.

R. A. Rossi, K. Nesreen, and . Ahmed, The Network Data Repository with Interactive Graph Analytics and Visualization, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.

M. Rosvall, D. Axelsson, and C. T. Bergstrom, The map equation, European Physical Journal Special Topics, vol.178, pp.13-23, 2009.

M. Rosvall and C. T. Bergstrom, An information-theoretic framework for resolving community structure in complex networks, Proceedings of the National Academy of Sciences 104.18, pp.7327-7331, 2007.

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

M. Rosvall and C. T. Bergstrom, Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems, PLoS ONE 6.4. Ed. by Fabio Rapallo, 2011.

G. Sabidussi, The centrality index of a graph, Psychometrika 31, vol.4, pp.581-603, 1966.

N. Saitou and M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Molecular Biology and Evolution, 1987.

S. Schaeffer and . Elisa, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.

M. T. Schaub, M. Jean-charles-delvenne, R. Rosvall, and . Lambiotte, The many facets of community detection in complex networks, Applied Network Science, 2017.

V. Sekara, A. Stopczynski, and S. Lehmann, Fundamental structures of dynamic social networks, Proceedings of the National Academy of Sciences 113.36, pp.9977-9982, 2016.

P. Sen, S. Dasgupta, A. Chatterjee, P. A. Sreeram, G. Mukherjee et al., Small-world properties of the Indian railway network, Phys. Rev. E, vol.67, issue.3, p.36106, 2003.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, pp.379-423, 1948.

B. W. Silverman, Density estimation for statistics and data analysis, p.412246201, 1986.

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 -KDD10, 2010.

M. Stanley, The Small World Problem, Psychology today, pp.515-554, 1967.

J. Stelling, S. Klamt, K. Bettenbrock, S. Schuster, and E. D. Gilles, Metabolic network structure determines key aspects of functionality and regulation, 2002.

J. Su, A. Sharma, and S. Goel, Proceedings of the 25th International Conference on World Wide Web. WWW '16, pp.1157-1167, 2016.

. Subbian, C. C. Karthik, J. Aggarwal, and . Srivastava, Querying and Tracking Influencers in Social Streams, Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. WSDM '16. ACM, pp.493-502, 2016.

V. A. Traag, R. Aldecoa, and J. Delvenne, Detecting communities using asymptotical surprise, 2015.

V. A. Traag, P. Van-dooren, and Y. Nesterov, Narrow scope for resolutionlimit-free community detection, Physical Review E, vol.84, 2011.

J. R. Treichler, M. G. Larimore, S. L. Wood, and M. Rabbat, Determining the topology of a telephone system using internally sensed network tomography". In: 3rd IEEE Signal Processing Education Workshop, IEEE 11th Digital Signal Processing Workshop, pp.259-262, 2004.

. Van-laarhoven, E. Twan, and . Marchiori, Axioms for Graph Clustering Quality Functions, J. Mach. Learn. Res. 15, vol.1, pp.1532-4435, 2014.

A. Vázquez, R. Pastor-satorras, and A. Vespignani, Large-scale topological and dynamical properties of the Internet, Phys. Rev. E, vol.65, issue.6, p.66130, 2002.

N. Vinh, J. Xuan, J. Epps, and . Bailey, Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance, J. Mach. Learn. Res, vol.11, pp.1532-4435, 2010.

V. Luxburg, A. Ulrike, M. Radl, and . Hein, Hitting and Commute Times in Large Random Neighborhood Graphs, J. Mach. Learn. Res. 15, vol.1, pp.1532-4435, 2014.

S. Wasserman, Social network analysis : methods and applications, p.9780521387071, 1994.

D. J. Watts, Small Worlds: The Dynamics of Networks Between Order and Randomness, pp.0-691, 1999.

D. J. Watts, H. Steven, and . Strogatz, Collective dynamics of 'smallworld' networks, Nature 393, vol.6684, pp.440-442, 1998.

J. G. White, E. Southgate, J. N. Thomson, and S. Brenner, The structure of the nervous system of the nematode Caenorhabditis elegans, Philosophical Transactions of the Royal Society of London B: Biological Sciences 314.1165, pp.1-340, 1986.

Z. Wunderlich and L. A. Mirny, Using the topology of metabolic networks to predict viability of mutant strains, Biophysical Journal, vol.91, 2006.

J. Xie and B. K. Szymanski, Community detection using a neighborhood strength driven Label Propagation Algorithm, IEEE Network Science Workshop. IEEE, 2011.

J. Xie and B. K. Szymanski, Towards Linear Time Overlapping Community Detection in Social Networks, Advances in Knowledge Discovery and Data Mining, pp.25-36, 2012.

J. Yang and J. Leskovec, Defining and Evaluating Network Communities based on Ground-truth, Proceedings of 2012 IEEE International Conference on Data Mining (ICDM), 2012.

J. Yang, J. Mcauley, and J. Leskovec, Community Detection in Networks with Node Attributes, 2013 IEEE 13th International Conference on Data Mining, pp.1151-1156, 2013.

J. Yang and J. Leskovec, Defining and evaluating network communities based on ground-truth, Knowledge and Information Systems, vol.42, pp.181-213, 2013.

Z. Yang, R. Algesheimer, and C. J. Tessone, A Comparative Analysis of Community Detection Algorithms on Artificial Networks, Scientific Reports 6.1. DOI: 10 . 1038 / srep30750, 2016.

W. W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, pp.452-473, 1977.

G. Zipf and . Kingsley, Human Behavior and the Principle of Least Effort, 1949.