L. A. Adamic and E. Adar, Friends and neighbors on the Web, Social Networks, vol.25, issue.3, pp.211-230, 2003.
DOI : 10.1016/S0378-8733(03)00009-1
URL : http://ehv-srvhost-fe.fontys.nl/co/com2know/kennisbank-onderwijs/knipsels/Zweekhorst/Friends and neighbors on the web.pdf

R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.86, issue.1, pp.47-97, 2002.
DOI : 10.1103/PhysRevLett.86.5835

R. Aldecoa and I. Marín, Deciphering Network Community Structure by Surprise, PLoS ONE, vol.36, issue.9, 2011.
DOI : 10.1371/journal.pone.0024195.s008
URL : https://doi.org/10.1371/journal.pone.0024195

H. Almeida, D. Guedes, W. Meira, and M. J. Zaki, Is There a Best Quality Metric for Graph Clusters?, Proc. Eur. Conf. Machine Learning & Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD'11), pp.44-59, 2011.
DOI : 10.14778/1687627.1687709
URL : http://www.cs.rpi.edu/%7Ezaki/PaperDir/PKDD11.pdf

G. Aloi, M. D. Felice, V. Loscrì, P. Pace, and G. Ruggeri, Spontaneous smartphone networks as a user-centric solution for the future internet, IEEE Communications Magazine, vol.52, issue.12, pp.26-33, 2014.
DOI : 10.1109/MCOM.2014.6979948
URL : https://hal.archives-ouvertes.fr/hal-01077445

U. Alon, Biological Networks: The Tinkerer as an Engineer, Science, vol.301, issue.5641, pp.1866-1867, 2003.
DOI : 10.1126/science.1089072

L. A. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, Classes of small-world networks, Proceedings of the National Academy of Sciences, vol.48, issue.5411, pp.11149-11152, 2000.
DOI : 10.1126/science.284.5411.96

A. Amelio and C. Pizzuti, Is normalized mutual information a fair measure for comparing community detection methods ? Proc, Advances in Social Networks Analysis and Mining (ASONAM'15), pp.1584-1585, 2015.

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

V. Antoine and N. Labroche, Classification évidentielle avec contraintes d'étiquettes, Proc. 2015 French. Conf. Extraction Gestion de Connaissances (EGC'15) 2015, 2015.

V. Antoine, N. Labroche, and V. V. Vu, Evidential seed-based semi-supervised clustering, 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS), p.14, 2014.
DOI : 10.1109/SCIS-ISIS.2014.7044676
URL : https://hal.archives-ouvertes.fr/hal-01622695

A. S. Asratian, T. M. Denley, and R. Häggkvist, Bipartite Graphs and Their Applications, 1998.
DOI : 10.1017/CBO9780511984068

C. Avin, M. Koucký, and Z. Lotker, How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs), Automata, Languages and Programming, pp.121-132, 2008.
DOI : 10.1007/978-3-540-70575-8_11

T. Aynaud, Détection de communautés dans les réseaux dynamiques, Thèse de doctorat, 2011.

T. Aynaud, E. Fleury, J. Guillaume, and Q. Wang, Communities in Evolving Networks: Definitions, Detection, and Analysis Techniques, Dynamics on and of Complex Networks, pp.159-200, 2013.
DOI : 10.1007/978-1-4614-6729-8_9
URL : https://hal.archives-ouvertes.fr/hal-00746195

T. Aynaud and J. Guillaume, Static community detection algorithms for evolving networks, Proc. 8th Int. Symp. on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp.513-519, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00492058

L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna, Four degrees of separation, Proceedings of the 3rd Annual ACM Web Science Conference on, WebSci '12, pp.33-42, 2012.
DOI : 10.1145/2380718.2380723

J. P. Bagrow and E. M. Bollt, Local method for detecting communities, Physical Review E, vol.33, issue.4, 2005.
DOI : 10.1086/jar.33.4.3629752
URL : http://arxiv.org/pdf/cond-mat/0412482

A. Barabási, Network science, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.406, issue.6794, 2016.
DOI : 10.1038/35019019

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

A. Barabási, H. Jeong, Z. Néda, E. Ravasz, A. Schubert et al., Evolution of the social network of scientific collaborations. Physica A : Statistical mechanics and its applications, pp.590-614, 2002.

A. Barabási and H. E. Stanley, Fractal concepts in surface growth, 1995.

S. Basu, M. Bilenko, and R. J. Mooney, A probabilistic framework for semisupervised clustering, Proc. 10th Int. Conf. ACM SIGKDD on Knowledge Discovery and Data mining, pp.59-68, 2004.

E. Bauman and K. Bauman, Discovering the Graph Structure in the Clustering Results, 2017.

P. Bedi and C. Sharma, Community detection in social networks, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol.65, issue.3, pp.115-135, 2016.
DOI : 10.1002/asi.23003

N. Ben, C. Cir, G. Cleuziou, and N. Essoussi, Overview of Overlapping Partitional Clustering Methods, Partitional Clustering Algorithms, pp.245-275, 2015.

J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.
DOI : 10.1007/978-1-4757-0450-1

A. Bland, FireChat ? the messaging app that's powering the Hong Kong protests. The Guardian, 2014.

V. D. Blondel, J. Guillaume, J. M. Hendrickx, C. De-kerchove, and R. Lambiotte, Local leaders in random networks, Physical Review E, vol.77, issue.3, pp.77-036114, 2008.
DOI : 10.1137/S003614450342480
URL : https://hal.archives-ouvertes.fr/hal-01146073

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

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. U. Hwang, Complex networks: Structure and dynamics, Physics Reports, vol.424, issue.4-5, pp.175-308, 2006.
DOI : 10.1016/j.physrep.2005.10.009

B. Bollobás, The Isoperimetric Number of Random Regular Graphs, European Journal of Combinatorics, vol.9, issue.3, pp.241-244, 1988.
DOI : 10.1016/S0195-6698(88)80014-3

B. Bollobás, Modern Graph Theory, 1998.
DOI : 10.1007/978-1-4612-0619-4

B. Bollobás, Random graphs, Cambridge Studies in Advanced Mathematics, vol.73, 2001.

S. Bornholdt and H. G. Schuster, Handbook of graphs and networks : from the genome to the internet, 2006.
DOI : 10.1002/3527602755

C. Bothorel, D. Cruz, J. Magnani, M. Micenková, and B. , Abstract, Network Science, vol.9, issue.03, pp.408-444, 2015.
DOI : 10.1080/01621459.1971.10482356

P. Brach, M. Cygan, J. L?cki, and P. Sankowski, Algorithmic Complexity of Power Law Networks, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1306-1325, 2016.
DOI : 10.1137/1.9781611974331.ch91

U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer et al., On Finding Graph Clusterings with Maximum Modularity, Proc. 33th Int. Workshop on Graph-Theoretic Concepts in Computer Science, pp.121-132, 2007.
DOI : 10.1007/978-3-540-74839-7_12
URL : http://i11www.ira.uka.de/extra/publications/bdhggnw-fgcmm-07.pdf

S. Brin, L. B. Page, C. Amsterdam-bron, and J. Kerbosch, The Anatomy of a Large-Scale Hypertextual Web Search Engine Algorithm 457 : finding all cliques of an undirected graph, Proc. 7th Int. Conf. on World Wide Web (WWW'98), pp.107-117, 1973.

A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz, Recent Advances in Graph Partitioning, Algorithm Engineering, pp.117-158, 2016.

M. Canu, M. Detyniecki, and M. Lesot, Utilisation de la structure communautaire pour guider une marche aléatoire, Proc. 5th French Conf. Modèles et Analyse des Réseaux : Approches Mathématiques et Informatiques (MARAMI'14), 2014.

M. Canu, M. Detyniecki, M. Lesot, and A. Revault-d-'allonnes, Fast community structure local uncovering by independent vertex-centred process, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, ASONAM '15, pp.823-830, 2015.
DOI : 10.1007/s10115-013-0693-z
URL : https://hal.archives-ouvertes.fr/hal-01194324

M. Canu, M. Lesot, and A. Revault-d-'allonnes, Détection de communautés recouvrantes orientée sommet, Proc. 7th French Conf. Modèles et Analyse des Réseaux : Approches Mathématiques et Informatiques (MARAMI'16), 2016.

M. Canu, M. Lesot, and A. Revault-d-'allonnes, Overlapping Community Detection by Local Decentralised Vertex-Centred Process, 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW), pp.77-84, 2016.
DOI : 10.1109/ICDMW.2016.0019
URL : https://hal.archives-ouvertes.fr/hal-01438423

Y. Cao and Z. Sun, Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges, IEEE Communications Surveys & Tutorials, vol.15, issue.2, pp.654-677, 2013.
DOI : 10.1109/SURV.2012.042512.00053

K. Carrier, National Longitudinal Study of Adolescent to Adult Health, 2017.

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-Varying Graphs and Dynamic Networks, Ad-hoc, Mobile, and Wireless Networks, pp.346-359, 2011.
DOI : 10.1080/17445760.2012.668546
URL : https://hal.archives-ouvertes.fr/hal-00854287

R. Cazabet and F. Amblard, Simulate to Detect: A Multi-agent System for Community Detection, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, pp.402-408, 2011.
DOI : 10.1109/WI-IAT.2011.50

D. Centola and M. Macy, Complex Contagions and the Weakness of Long Ties, American Journal of Sociology, vol.113, issue.3, 2007.
DOI : 10.1086/521848

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Pocket Switched Networks : Real-world mobility and its consequences for opportunistic forwarding, 2005.

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Impact of Human Mobility on Opportunistic Forwarding Algorithms, IEEE Transactions on Mobile Computing, vol.6, issue.6, pp.606-620, 2007.
DOI : 10.1109/TMC.2007.1060

D. Chakrabarti and C. Faloutsos, Graph mining, ACM Computing Surveys, vol.38, issue.1, 2006.
DOI : 10.1145/1132952.1132954

D. Chakrabarti, R. Kumar, and A. Tomkins, Evolutionary clustering, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.554-560, 2006.
DOI : 10.1145/1150402.1150467

S. Chan, P. Hui, and K. Xu, Community Detection of Time-Varying Mobile Social Networks, Complex Sciences, pp.1154-1159, 2009.
DOI : 10.1088/1367-2630/9/6/180

J. Cheeger, A Lower Bound for the Smallest Eigenvalue of the Laplacian, 1969.
DOI : 10.1515/9781400869312-013

J. Chen, O. Zaïane, and R. Goebel, Local Community Identification in Social Networks, 2009 International Conference on Advances in Social Network Analysis and Mining, pp.237-242, 2009.
DOI : 10.1109/ASONAM.2009.14

W. Chen, Z. Liu, X. Sun, and Y. Wang, A game-theoretic framework to identify overlapping communities in social networks, Data Mining and Knowledge Discovery, vol.33, issue.4, pp.224-240, 2010.
DOI : 10.1086/jar.33.4.3629752

D. Chowdhury, L. Santen, and A. Schadschneider, Statistical physics of vehicular traffic and some related systems, Physics Reports, vol.329, issue.4-6, pp.199-329, 2000.
DOI : 10.1016/S0370-1573(99)00117-9

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

A. Clauset, C. R. Shalizi, and M. E. Newman, Power-Law Distributions in Empirical Data, SIAM Review, vol.51, issue.4, pp.661-703, 2009.
DOI : 10.1137/070710111
URL : http://arxiv.org/pdf/0706.1062

A. Clementi, D. Ianni, M. Gambosi, G. Natale, E. Silvestri et al., Distributed community detection in dynamic graphs, Theoretical Computer Science, vol.584, pp.19-41, 2015.
DOI : 10.1016/j.tcs.2014.11.026

G. Cleuziou, An extended version of the k-means method for overlapping clustering, 2008 19th International Conference on Pattern Recognition, pp.1-4, 2008.
DOI : 10.1109/ICPR.2008.4761079
URL : https://hal.archives-ouvertes.fr/hal-00466009

S. Cohen, B. Kimelfeld, and G. Koutrika, A Survey on Proximity Measures for Social Networks, Search Computing, pp.191-206, 2012.
DOI : 10.1007/978-3-642-34213-4_13

Y. Cohen, D. Hendler, and A. Rubin, Node-centric detection of overlapping communities in social networks, Proc. 2016 IEEE/ACM Int. Conf. Advances in Social Networks Analysis and Mining (ASONAM'16), pp.1384-1385, 2016.

V. Colizza, A. Flammini, M. A. Serrano, and A. Vespignani, Detecting rich-club ordering in complex networks, Nature Physics, vol.65, issue.2, pp.110-115, 2006.
DOI : 10.1038/nphys209

M. Conti and S. Giordano, Mobile ad hoc networking: milestones, challenges, and new research directions, IEEE Communications Magazine, vol.52, issue.1, pp.85-96, 2014.
DOI : 10.1109/MCOM.2014.6710069

G. Cordasco and L. Gargano, Label propagation algorithm: a semi-synchronous approach, International Journal of Social Network Mining, vol.1, issue.1, pp.3-26, 2012.
DOI : 10.1504/IJSNM.2012.045103
URL : https://doi.org/10.1504/ijsnm.2012.045103

B. Costa, L. D. Jr, O. N. Travieso, G. Rodrigues, F. A. Boas et al., Analyzing and modeling real-world phenomena with complex networks : a survey of applications Advances in Physics, pp.329-412, 2011.

P. Costa, C. Mascolo, M. Musolesi, and G. Picco, Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks, IEEE Journal on Selected Areas in Communications, vol.26, issue.5, pp.748-760, 2008.
DOI : 10.1109/JSAC.2008.080602

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in Algebra and Programming?CAAP'94, pp.68-84, 1994.
DOI : 10.1007/BFb0017474

E. M. Daly and M. Haahr, Social network analysis for routing in disconnected delay-tolerant MANETs, Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '07, pp.32-40, 2007.
DOI : 10.1145/1288107.1288113

M. Danisch, Mesures de proximité appliquées à la détection de communautés dans les grands graphes de terrain, Thèse de Doctorat, 2015.

M. Danisch, J. Guillaume, and B. L. Grand, Une approche à base de proximité pour la détection de communautés egocentrées, Proc. 4th French Conf. Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'13), pp.1-4, 2013.

M. Danisch, J. Guillaume, and B. Le-grand, Towards multi-ego-centred communities: a node similarity approach, International Journal of Web Based Communities, vol.9, issue.3, pp.299-322, 2013.
DOI : 10.1504/IJWBC.2013.054906

L. Danon, A. Díaz-guilera, J. Duch, and A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, vol.2005, issue.09, p.9008, 2005.
DOI : 10.1088/1742-5468/2005/09/P09008
URL : http://arxiv.org/pdf/cond-mat/0505245

D. Meo, P. Ferrara, E. Fiumara, G. Provetti, and A. , On Facebook, most ties are weak, Communications of the ACM, vol.57, issue.11, pp.78-84, 2014.
DOI : 10.1145/2629438

I. Derényi, G. Palla, and T. Vicsek, Clique Percolation in Random Networks, Physical Review Letters, vol.21, issue.16, p.160202, 2005.
DOI : 10.1177/0038038588022001007

E. Desmier, Co-evolution pattern mining in dynamic attributed graphs, 2014.
DOI : 10.1007/978-3-642-33492-4_11
URL : https://hal.archives-ouvertes.fr/tel-01127630

I. S. Dhillon, Y. Guan, and B. Kulis, Weighted Graph Cuts without Eigenvectors A Multilevel Approach, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.11, 2007.
DOI : 10.1109/TPAMI.2007.1115
URL : http://www.cs.utexas.edu/~kulis/pubs/pami_multilevel.pdf

D. Pietro, R. Domingo-ferrer, and J. , Security in Wireless Ad Hoc Networks, Mobile Ad Hoc Networking, pp.106-153, 2013.
DOI : 10.1109/5326.760570

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

D. Dor and M. Tarsi, Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture, SIAM Journal on Computing, vol.26, issue.4, pp.1166-1187, 1997.
DOI : 10.1137/S0097539792229507

P. Doreian, V. Batagelj, and A. Ferligoj, Generalized blockmodeling. No. 25 in Structural Analysis in the Social Sciences, 2005.
DOI : 10.1017/cbo9780511584176

S. N. Dorogovtsev, A. V. Goltsev, and J. F. Mendes, -Core Organization of Complex Networks, Physical Review Letters, vol.67, issue.4, p.40601, 2006.
DOI : 10.1103/PhysRevE.64.026118

S. N. Dorogovtsev and J. F. Mendes, Evolution of networks, Advances in Physics, vol.11, issue.4, pp.1079-1187, 2002.
DOI : 10.1038/35091039

A. Dutot, F. Guin, D. Olivier, and Y. Pigné, Graphstream : A tool for bridging the gap between complex systems and dynamic graphs, Proc. 2007 Workshop on Emergent Properties in Natural and Artificial Complex Systems (EPNACS'07), Eur. Conf. Complex Systems (ECCS'07), 2007.
URL : https://hal.archives-ouvertes.fr/hal-00264043

F. Dörfler and F. Bullo, Synchronization in complex networks of phase oscillators: A survey, Automatica, vol.50, issue.6, pp.1539-1564, 2014.
DOI : 10.1016/j.automatica.2014.04.012

P. Erdös and A. Rényi, On random graphs, I, pp.290-297, 1959.

L. Euler, Solutio problematis ad geometriam situs pertinentis. Commentarii academiae scientiarum Petropolitanae, pp.128-140, 1741.

T. S. Evans, Clique graphs and overlapping communities, Journal of Statistical Mechanics: Theory and Experiment, vol.2010, issue.12, p.12037, 2010.
DOI : 10.1088/1742-5468/2010/12/P12037
URL : http://www.unifr.ch/econophysics/paper/download/id/1009.0638/format/pdf/

B. S. Everitt, An Introduction to Latent Variable Models, 1984.
DOI : 10.1007/978-94-009-5564-6

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On Power-law Relationships of the Internet Topology, Proc. Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp.251-262, 1999.

L. R. Ford, Network flow theory, 1956.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2009.
DOI : 10.1016/j.physrep.2009.11.002

S. Fortunato and M. Barthélemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, vol.298, issue.5594, 2007.
DOI : 10.1126/science.298.5594.824
URL : http://www.pnas.org/content/104/1/36.full.pdf

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

S. Foss, D. Korshunov, and S. Zachary, An Introduction to Heavy-Tailed and Subexponential Distributions, 2011.
DOI : 10.1007/978-1-4419-9473-8
URL : http://www.mfo.de/publications/owp/2009/OWP2009_13.pdf

L. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry, vol.40, issue.1, pp.35-41, 1977.
DOI : 10.2307/3033543

L. C. Freeman, Centered graphs and the structure of ego networks, Mathematical Social Sciences, vol.3, issue.3, pp.291-304, 1982.
DOI : 10.1016/0165-4896(82)90076-2

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.4153/CJM-1964-055-5

B. Gao, W. Luo, W. Bu, and C. , Evolutionary community discovery in dynamic networks based on leader nodes, Proc. 2016 Int. Conf. on Big Data and Smart Computing, pp.16-53, 2016.

N. Gaumont, Groupes et Communautés dans les flots de liens : des données aux algorithmes, Thèse de doctorat, 2016.

C. Giatsidis, D. M. Thilikos, and M. Vazirgiannis, Evaluating Cooperation in Communities with the k-Core Structure, 2011 International Conference on Advances in Social Networks Analysis and Mining, pp.87-93, 2011.
DOI : 10.1109/ASONAM.2011.65

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, vol.139, issue.21, pp.7821-7826, 2002.
DOI : 10.1086/285382

D. F. Gleich and C. Seshadhri, Vertex neighborhoods, low conductance cuts, and good seeds for local community methods, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, 2012.
DOI : 10.1145/2339530.2339628

C. Granell, R. K. Darst, A. Arenas, S. Fortunato, and S. Gómez, Benchmark model to assess community structure in evolving networks, Physical Review E, vol.3, issue.1, pp.92-012805, 2015.
DOI : 10.1103/PhysRevE.90.022813

M. S. Granovetter, The Strength of Weak Ties, American Journal of Sociology, vol.78, issue.6, pp.1360-1380, 1973.
DOI : 10.1086/225469

D. Greene, D. Doyle, and P. Cunningham, Tracking the Evolution of Communities in Dynamic Social Networks, 2010 International Conference on Advances in Social Networks Analysis and Mining, pp.176-183, 2010.
DOI : 10.1109/ASONAM.2010.17

S. Gregory, Finding overlapping communities in networks by label propagation, New Journal of Physics, vol.12, issue.10, pp.1-26, 2010.
DOI : 10.1088/1367-2630/12/10/103018

S. Gregory, Fuzzy overlapping communities in networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2011, issue.02, p.2017, 2011.
DOI : 10.1088/1742-5468/2011/02/P02017
URL : http://arxiv.org/pdf/1010.1523

J. Guillaume, Déterminisme et non-déterminisme au service de la détection de communautés dynamiques. Habilitation à Diriger les Recherches, 2012.

R. Görke, P. Maillard, C. Staudt, and D. Wagner, Modularity-Driven Clustering of Dynamic Graphs. Experimental Algorithms, pp.436-448, 2010.

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

M. Han, K. Daudjee, K. Ammar, M. T. Özsu, X. Wang et al., An experimental comparison of pregel-like graph processing systems, Proc. VLDB Endow, pp.1047-1058, 2014.
DOI : 10.14778/2732977.2732980

X. Han, L. Wang, S. Park, A. Cuevas, and N. Crespi, Alike people, alike interests? A large-scale study on interest similarity in social networks, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), 2014.
DOI : 10.1109/ASONAM.2014.6921631
URL : https://hal.archives-ouvertes.fr/hal-01340426

. Conf, Advances in Social Networks Analysis and Mining (ASONAM'14) (pp, pp.491-496

M. S. Handcock, A. E. Raftery, and J. M. Tantrum, Model-based clustering for social networks, Journal of the Royal Statistical Society: Series A (Statistics in Society), vol.6, issue.2, pp.301-354, 2007.
DOI : 10.1111/j.1467-9574.2005.00283.x

M. B. Hastings, Community detection as an inference problem, Physical Review E, vol.33, issue.3, pp.74-035102, 2006.
DOI : 10.1080/00018739400101505
URL : http://arxiv.org/pdf/cond-mat/0604429

S. He-li, H. Jian-bin, T. Yong-qiang, S. Qin-bao, and L. Huai-liang, Detecting overlapping communities in networks via dominant label propagation, Chinese Phys. B, vol.24, p.18703, 2015.

A. Hern, Firechat updates as 40,000 Iraqis download 'mesh' chat app in censored Baghdad. The Guardian, 2014.

M. Hmimida and R. Kanawati, Community Detection in Multiplex Networks : a Seed-Centric Approach. Networks & Heterogeneous Media, 2015.

P. D. Hoff, A. E. Raftery, and M. S. Handcock, Latent Space Approaches to Social Network Analysis, Journal of the American Statistical Association, vol.97, issue.460, pp.1090-1098, 2002.
DOI : 10.1198/016214502388618906
URL : http://www.csss.washington.edu/Papers/wp17.ps

P. W. Holland, K. B. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps, Social Networks, vol.5, issue.2, pp.109-137, 1983.
DOI : 10.1016/0378-8733(83)90021-7

S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.04, pp.439-561, 2006.
DOI : 10.1090/S0273-0979-06-01126-8
URL : http://www.ams.org/bull/2006-43-04/S0273-0979-06-01126-8/S0273-0979-06-01126-8.pdf

J. Hopcroft, O. Khan, B. Kulis, and B. Selman, Tracking evolving communities in large linked networks, Proceedings of the National Academy of Sciences, vol.30, issue.suppl_1, pp.5249-5253, 2004.
DOI : 10.1016/S0169-7552(98)00110-X

D. Hric, R. K. Darst, and S. Fortunato, Community detection in networks: Structural communities versus ground truth, Physical Review E, vol.33, issue.6, pp.90-062805, 2014.
DOI : 10.1371/journal.pone.0018961

L. Hubert and P. Arabie, Comparing partitions, Journal of Classification, vol.78, issue.1, pp.193-218, 1985.
DOI : 10.1007/978-3-642-69024-2_27

P. Hui, J. Crowcroft, and E. Yoneki, Bubble rap, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '08, pp.1576-1589, 2011.
DOI : 10.1145/1374618.1374652

P. Hui, E. Yoneki, S. Y. Chan, and J. Crowcroft, Distributed community detection in delay tolerant networks, Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture , MobiArch '07, 2007.
DOI : 10.1145/1366919.1366929

F. Höppner, F. Klawonn, R. Kruse, and T. Runkler, Fuzzy Cluster Analysis : Methods for Classification, Data Analysis and Image Recognition, 1999.

B. Jaccard and P. , Etude comparative de la distribution florale dans une portion des Alpes et des Jura, Bulletin de la Société Vaudoise des Sciences Naturelles, vol.37, pp.547-579, 1901.

A. K. Jain, M. N. Murty, and P. J. Flynn, Data clustering: a review, ACM Computing Surveys, vol.31, issue.3, pp.264-323, 1999.
DOI : 10.1145/331499.331504

L. O. James, R. G. Stanton, and D. D. Cowan, Graph decomposition for undirected graphs, Proc. 3rd Southeastern Conf. on Combinatorics, Graph Theory, and Computing, pp.281-290, 1972.

N. Jardine and R. Sibson, The construction of hierarchic and non-hierarchic classifications . The computer journal, pp.177-184, 1968.

G. Jeh and J. Widom, Scaling personalized web search, Proceedings of the twelfth international conference on World Wide Web , WWW '03, pp.271-279, 2003.
DOI : 10.1145/775152.775191

M. Jerrum and A. Sinclair, Approximating the Permanent, SIAM Journal on Computing, vol.18, issue.6, pp.1149-1178, 1989.
DOI : 10.1137/0218077
URL : http://www.cs.berkeley.edu/~sinclair/perm.pdf

S. C. Johnson, Hierarchical clustering schemes, Psychometrika, vol.58, issue.4, pp.241-254, 1967.
DOI : 10.1099/00221287-17-1-201

M. Jünger and P. Mutzel, Graph drawing software, 2012.
DOI : 10.1007/978-3-642-18638-7

R. Kanawati, Seed-Centric Approaches for Community Detection in Complex Networks, Social Computing and Social Media, pp.197-208, 2014.
DOI : 10.1007/978-3-319-07632-4_19

R. Kanawati, YASCA: An Ensemble-Based Approach for Community Detection in Complex Networks, Computing and Combinatorics, pp.657-666, 2014.
DOI : 10.1007/978-3-319-08783-2_57

D. Karamshuk, C. Boldrini, M. Conti, and A. Passarella, Human mobility models for opportunistic networks, IEEE Communications Magazine, vol.49, issue.12, pp.157-165, 2011.
DOI : 10.1109/MCOM.2011.6094021

B. Karrer and M. E. Newman, Stochastic blockmodels and community structure in networks, Physical Review E, vol.33, issue.1, p.16107, 2011.
DOI : 10.1088/1742-5468/2006/11/P11010

G. Karypis, E. Han, and V. Kumar, Chameleon: hierarchical clustering using dynamic modeling, Computer, vol.32, issue.8, pp.68-75, 1999.
DOI : 10.1109/2.781637

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno et al., Multilayer networks, Journal of Complex Networks, vol.22, issue.1, pp.203-271, 2014.
DOI : 10.1063/1.4769991

J. Kleinberg, Small-world phenomena and the dynamics of information, Advances in Neural Information Processing Systems (NIPS'02, pp.431-438, 2002.

J. Kleinberg and E. Tardos, Algorithm Design, 2005.

J. M. Kleinberg, An impossibility theorem for clustering, Advances in Neural Information Processing Systems (NIPS'03), pp.463-470, 2003.

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/pdf/1403.3148.pdf

D. Knoke, Political networks : the structural perspective, 1994.
DOI : 10.1017/CBO9780511527548

D. Knoke, Economic networks, 2014.

G. Kossinets and D. J. Watts, Origins of Homophily in an Evolving Social Network, American Journal of Sociology, vol.115, issue.2, 2009.
DOI : 10.1086/599247

V. Krebs, Uncloaking Terrorist Networks, First Monday, vol.7, issue.4, 2002.
DOI : 10.5210/fm.v7i4.941

V. Labatut, Étude de l'omniprésence des propriétés petit-monde et sans-échelle, 2014.

V. Labatut, Generalised measures for the evaluation of community detection methods, International Journal of Social Network Mining, vol.2, issue.1, pp.44-63, 2015.
DOI : 10.1504/IJSNM.2015.069776

M. Laibowitz, J. Gips, R. Aylward, A. Pentland, and J. Paradiso, A sensor network for social dynamics, Proceedings of the fifth international conference on Information processing in sensor networks , IPSN '06, pp.483-491, 2006.
DOI : 10.1145/1127777.1127851

A. Lancichinetti and S. Fortunato, Limits of modularity maximization in community detection, Physical Review E, vol.70, issue.6, p.66122, 2011.
DOI : 10.1103/PhysRevE.81.046110

A. Lancichinetti, S. Fortunato, and J. Kertesz, Detecting the overlapping and hierarchical community structure in complex networks, New Journal of Physics, vol.11, issue.3, p.33015, 2009.
DOI : 10.1088/1367-2630/11/3/033015

A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark graphs for testing community detection algorithms, Physical Review E, vol.2005, issue.4, pp.78-046110, 2008.
DOI : 10.1073/pnas.0605965104
URL : http://arxiv.org/pdf/0805.4770

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
URL : http://doi.org/10.1371/journal.pone.0018961

K. Lang and S. Rao, A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts, Integer Programming and Combinatorial Optimization, pp.325-337, 2004.
DOI : 10.1007/978-3-540-25960-2_25

C. Lee, F. Reid, A. Mcdaid, and N. Hurley, Detecting highly overlapping community structure by greedy clique expansion, Proc. of the 4th SNA-KDD workshop on social network mining and analysis, 16th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data mining (KDD'09), 2010.

K. Lee, P. Hui, and S. Chong, Mobility Models in Opportunistic Networks, Mobile Ad Hoc Networking, pp.360-418, 2013.
DOI : 10.1109/TNET.2007.905154

K. Lee, Y. Lee, H. Choi, Y. D. Chung, and B. Moon, Parallel data processing with MapReduce, ACM SIGMOD Record, vol.40, issue.4, pp.11-20, 2012.
DOI : 10.1145/2094114.2094118

E. A. Leicht, P. Holme, and M. E. Newman, Vertex similarity in networks, Physical Review E, vol.26, issue.2, 2006.
DOI : 10.1098/rsif.2005.0046

H. Lepp, An Investigation of Decentralized Networks Based Upon Wireless Mobile Technologies, Intersect : The Stanford Journal of Science, vol.8, 2015.

J. Leskovec and C. Faloutsos, Sampling from large graphs, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.631-636, 2006.
DOI : 10.1145/1150402.1150479

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graphs over time, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.177-187, 2005.
DOI : 10.1145/1081870.1081893

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

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, vol.6, issue.1, pp.29-123, 2009.
DOI : 10.1080/15427951.2009.10129177

I. X. Leung, P. Hui, P. Liò, and J. Crowcroft, Towards real-time community detection in large networks, Physical Review E, vol.79, issue.6, pp.79-066107, 2009.
DOI : 10.1126/science.286.5439.509

D. Liben-nowell and J. Kleinberg, The link-prediction problem for social networks, 2007.

Y. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng, Facetnet, Proceeding of the 17th international conference on World Wide Web , WWW '08, 2008.
DOI : 10.1145/1367497.1367590

L. Lovász, Random Walks on Graphs : A Survey, Combinatorics, Paul Erd?s is Eighty, pp.353-398, 1996.

L. Lovász and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Structures and Algorithms, vol.13, issue.4, pp.359-412, 1993.
DOI : 10.1007/978-3-642-58043-7_5

F. Luo, J. Z. Wang, and E. Promislow, Exploring local community structures in large networks. Web Intelligence and Agent Systems, An International Journal, vol.6, pp.387-400, 2008.
DOI : 10.1109/wi.2006.72

L. Lü and T. Zhou, Link prediction in complex networks : A survey. Physica A : Statistical Mechanics and its Applications, pp.1150-1170, 2011.

L. Ma, H. Huang, Q. He, K. Chiew, and Z. Liu, Toward seed-insensitive solutions to local community detection, Journal of Intelligent Information Systems, vol.33, issue.2, pp.183-203, 2014.
DOI : 10.1086/jar.33.4.3629752

J. P. Macker and M. S. Corson, Mobile ad hoc networking and the IETF, ACM SIGMOBILE Mobile Computing and Communications Review, vol.2, issue.4, pp.9-14, 1998.
DOI : 10.1145/1321400.1321409

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn et al., Pregel : A System for Large-scale Graph Processing, Proc. 2010 ACM SIGMOD Int. Conf. on Management of Data (ICMD'10), pp.135-146, 2010.

S. Mann, Smart clothing: the shift to wearable computing, Communications of the ACM, vol.39, issue.8, pp.23-24, 1996.
DOI : 10.1145/232014.232021

E. L. Martelot and C. Hankin, Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks, The Computer Journal, vol.56, issue.9, pp.1011-1027, 2014.
DOI : 10.1093/comjnl/bxt002

M. Masson and T. Denoeux, ECM: An evidential version of the fuzzy c-means algorithm, Pattern Recognition, vol.41, issue.4, pp.1384-1397, 2008.
DOI : 10.1016/j.patcog.2007.08.014

H. Matsuda, T. Ishihara, and A. Hashimoto, Classifying molecular sequences using a linkage graph with their pairwise similarities, Theoretical Computer Science, vol.210, issue.2, pp.305-325, 1999.
DOI : 10.1016/S0304-3975(98)00091-7

J. J. Mcauley, L. Da-fontoura-costa, and T. S. Caetano, Rich-club phenomenon across complex network hierarchies, Applied Physics Letters, vol.91, issue.8, p.84103, 2007.
DOI : 10.1038/35075138

R. M. Mcconnell and F. De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.198-209, 2005.
DOI : 10.1016/j.dam.2004.02.017
URL : https://hal.archives-ouvertes.fr/hal-00159571

R. R. Mccune, T. Weninger, and G. Madey, Thinking Like a Vertex, ACM Computing Surveys, vol.48, issue.2, pp.1-2539, 2015.
DOI : 10.1007/978-3-540-68880-8_32

A. F. Mcdaid, D. Greene, and N. Hurley, Normalized Mutual Information to evaluate overlapping community finding algorithms, 2011.

M. Mcpherson, L. Smith-lovin, and J. M. Cook, Birds of a Feather: Homophily in Social Networks, Annual Review of Sociology, vol.27, issue.1, pp.415-444, 2001.
DOI : 10.1146/annurev.soc.27.1.415

D. D. Melo, I. D. Fadigas, and H. B. Pereira, Community detection in visibility networks : an approach to categorize percussive influence on audio musical signals, Complex Networks & Their Applications V, pp.321-334, 2016.

R. K. Merton, The Matthew Effect in Science: The reward and communication systems of science are considered, Science, vol.159, issue.3810, pp.56-63, 1968.
DOI : 10.1126/science.159.3810.56

M. Mihail, C. Papadimitriou, and A. Saberi, On certain connectivity properties of the Internet topology, Proc. 44th IEEE Symp. on Foundations of Computer Science (FOCS'03), pp.28-35, 2003.

B. Milgram and S. , The Small World Problem, Psychology Today, vol.1, pp.61-67, 1967.
DOI : 10.1037/e400002009-005

B. Mitra, L. Tabourier, and C. Roth, Intrinsically dynamic network communities, Computer Networks, vol.56, issue.3, pp.1041-1053, 2012.
DOI : 10.1016/j.comnet.2011.10.024
URL : https://hal.archives-ouvertes.fr/halshs-00778666

B. Mohar, Isoperimetric numbers of graphs, Journal of Combinatorial Theory, Series B, vol.47, issue.3, pp.274-291, 1989.
DOI : 10.1016/0095-8956(89)90029-4

F. D. Montgolfier, Décomposition modulaire des graphes : théorie, extensions et algorithmes, Thèse de doctorat. Montpellier 2, Université des Sciences et Techniques du Languedoc, 2003.

F. Moradi, T. Olovsson, and P. Tsigas, A local seed selection algorithm for overlapping community detection, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), pp.1-8, 2014.
DOI : 10.1109/ASONAM.2014.6921552

J. L. Moreno and H. H. Jennings, Statistics of Social Configurations, Sociometry, vol.1, issue.3/4, pp.342-374, 1938.
DOI : 10.2307/2785588

P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, and J. Onnela, Community Structure in Time-Dependent, Multiscale, and Multiplex Networks, Community Structure in Time-Dependent, Multiscale, and Multiplex Networks, pp.876-878, 2010.
DOI : 10.1103/PhysRevE.80.036111

M. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

M. Newman, Networks : an introduction, 2010.
DOI : 10.1093/acprof:oso/9780199206650.001.0001

M. E. Newman, Coauthorship networks and patterns of scientific collaboration, Proceedings of the National Academy of Sciences, vol.99, issue.12, 2004.
DOI : 10.1073/pnas.122653799

M. E. Newman, Detecting community structure in networks, The European Physical Journal B - Condensed Matter, vol.38, issue.2, 2004.
DOI : 10.1140/epjb/e2004-00124-y

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.33, issue.6, pp.69-066133, 2004.
DOI : 10.1098/rsbl.2003.0057

M. E. Newman, Communities, modules and large-scale structure in networks, Nature Physics, vol.9, issue.1, 2012.
DOI : 10.1038/nature06830
URL : http://www-personal.umich.edu/~mejn/papers/npcommunities.pdf

M. E. Newman, Spectral methods for network community detection and graph partitioning, Phys. Rev. E, p.88, 2013.
DOI : 10.1103/physreve.88.042822
URL : http://arxiv.org/pdf/1307.7729

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.65, issue.2, pp.69-026113, 2004.
DOI : 10.1103/PhysRevE.68.065103

M. E. Newman and E. A. Leicht, Mixture models and exploratory analysis in networks, Proceedings of the National Academy of Sciences, vol.107, issue.7043, pp.9564-9569, 2007.
DOI : 10.1086/338954

B. Ngonmang, M. Tchuente, and E. Viennet, LOCAL COMMUNITY IDENTIFICATION IN SOCIAL NETWORKS, Parallel Processing Letters, vol.14, issue.01, p.1240004, 2012.
DOI : 10.1038/nature03607

L. Orecchia and Z. A. Zhu, Flow-Based Algorithms for Local Graph Clustering, 2014.
DOI : 10.1137/1.9781611973402.94

M. Orlinski and N. Filer, The rise and fall of spatio-temporal clusters in mobile ad hoc networks, Ad Hoc Networks, vol.11, issue.5, pp.1641-1654, 2013.
DOI : 10.1016/j.adhoc.2013.03.003

G. Orman, V. Labatut, M. Plantevit, and J. Boulicaut, A method for characterizing communities in dynamic attributed complex networks, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), 2014.
DOI : 10.1109/ASONAM.2014.6921629
URL : https://hal.archives-ouvertes.fr/hal-01011913

. Conf, Advances in Social Networks Analysis and Mining (ASONAM'14) (pp, pp.481-484

G. K. Orman, V. Labatut, and H. Cherifi, Towards realistic artificial benchmark for community detection algorithms evaluation, International Journal of Web Based Communities, vol.9, issue.3, pp.349-370, 2013.
DOI : 10.1504/IJWBC.2013.054908
URL : https://hal.archives-ouvertes.fr/hal-00840261

M. L. Ouellet, Terrorist Networks and the Collective Criminal Career : The Relationship between Group Structure and Trajectories. Thesis, Arts & Social Sciences : School of Criminology, 2016.

K. Ozawa, A stratificational overlapping cluster scheme, Pattern Recognition, vol.18, issue.3-4, pp.279-286, 1985.
DOI : 10.1016/0031-3203(85)90053-6

G. Palla, A. Barabási, and T. Vicsek, Quantifying social group evolution, Nature, vol.21, issue.7136, pp.664-667, 2007.
DOI : 10.1038/nature05670
URL : http://arxiv.org/pdf/0704.0744

G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.433, issue.7043, pp.814-818, 2005.
DOI : 10.1038/nature03248

G. Pan, W. Zhang, Z. Wu, and S. Li, Online Community Detection for Large Complex Networks, PLoS ONE, vol.11, issue.7, p.102799, 2014.
DOI : 10.1371/journal.pone.0102799.t006
URL : https://doi.org/10.1371/journal.pone.0102799

S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos, Community detection in Social Media, Data Mining and Knowledge Discovery, vol.21, issue.3, pp.515-554, 2012.
DOI : 10.1007/s11390-006-0393-1

&. Pentland and A. , Identifying and Facilitating Social Interaction with a Wearable Wireless Sensor Network. Personal Ubiquitous Comput, pp.137-152, 2010.

M. Plantevit, Y. W. Choong, A. Laurent, D. Laurent, and M. Teisseire, M2SP: Mining Sequential Patterns Among Several Dimensions, Proc. Eur. Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD'05), pp.205-216, 2005.
DOI : 10.1007/11564126_23
URL : https://hal.archives-ouvertes.fr/lirmm-00106087

P. Pons and M. Latapy, Computing Communities in Large Networks Using Random Walks, Computer and Information Sciences -ISCIS 2005, pp.284-293, 2005.

A. Prat-pérez, D. Dominguez-sal, J. M. Brunat, and J. Larriba-pey, Shaping communities out of triangles, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.1677-1681, 2012.
DOI : 10.1145/2396761.2398496

B. Price and D. D. , A general theory of bibliometric and other cumulative advantage processes, Journal of the American Society for Information Science, vol.5, issue.5, pp.292-306, 1976.
DOI : 10.1002/asi.4630270505

R. Rabbany, J. Chen, and O. R. Za?ane, Top leaders community detection approach in information networks, Proc. of the 4th SNA-KDD workshop on social network mining and analysis, 16th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data mining (KDD'09), 2010.

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.68, issue.4, pp.2658-2663, 2004.
DOI : 10.1080/0022250X.2001.9990249

U. N. Raghavan, R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks, Physical Review E, vol.33, issue.3, pp.76-036106, 2007.
DOI : 10.1140/epjb/e2004-00130-1

W. M. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.15, issue.336, 1971.
DOI : 10.1080/01621459.1963.10500845

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Physical Review E, vol.5, issue.1, p.74, 2006.
DOI : 10.1088/0305-4470/20/11/001

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

E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader, Parallel Community Detection for Massive Graphs, Parallel Processing and Applied Mathematics, pp.286-296, 2012.
DOI : 10.1090/conm/588/11703
URL : http://www.cc.gatech.edu/~bader/papers/CommunityDetection-PPAM2011.pdf

J. Riedy, D. A. Bader, K. Jiang, P. Pande, and R. Sharma, Detecting communities from given seeds in social networks, 2011.

D. Rigney, The Matthew Effect : How Advantage Begets Further Advantage, 2010.

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

G. Salton and M. J. Mcgill, Introduction to modern information retrieval, Computer Science Series), 1984.

M. Saltz, A. Prat-pérez, and D. Dominguez-sal, Distributed Community Detection with the WCC Metric, Proceedings of the 24th International Conference on World Wide Web, WWW '15 Companion, pp.1095-1100, 2015.
DOI : 10.1145/2433396.2433471

J. M. Santos and M. Embrechts, On the Use of the Adjusted Rand Index as a Metric for Evaluating Supervised Classification, Proc. Int. Conf. on Artificial Neural Networks, pp.175-184, 2009.
DOI : 10.1126/science.286.5439.531

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

M. T. Schaub, J. Delvenne, M. Rosvall, and R. Lambiotte, The many facets of community detection in complex networks, Applied Network Science, vol.42, issue.1, 2017.
DOI : 10.1007/s10115-013-0693-z

F. Schweitzer, Self-organization of complex structures : From individual to collective dynamics, 1997.

J. Scott, Social Network Analysis, Sociology, vol.23, issue.2, 2012.
DOI : 10.1111/j.1467-954X.1973.tb00500.x

C. Seshadhri, T. G. Kolda, and A. Pinar, Community structure and scale-free collections of Erd??s-R??nyi graphs, Physical Review E, vol.11, issue.5, p.56109, 2012.
DOI : 10.1038/nature09182

D. Shah and T. Zaman, Community detection in networks : The leader-follower algorithm, Proc. 2010 NIPS Workshop on Networks Across Discilines in Theory and Applications, 2010.

C. R. Shalizi and A. C. Thomas, Homophily and contagion are generically confounded in observational social network studies. Sociological methods & research, pp.211-239, 2011.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.4, pp.623-656, 1948.
DOI : 10.1002/j.1538-7305.1948.tb00917.x

H. Shen, X. Cheng, and J. Guo, Quantifying and identifying the overlapping community structure in networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2009, issue.07, p.7042, 2009.
DOI : 10.1088/1742-5468/2009/07/P07042

R. N. Shepard and P. Arabie, Additive clustering: Representation of similarities as combinations of discrete overlapping properties., Psychological Review, vol.86, issue.2, pp.87-123, 1979.
DOI : 10.1037/0033-295X.86.2.87

J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions on pattern analysis and machine intelligence, vol.22, pp.888-905, 2000.

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/pdf/cs/0310051v3.pdf

A. Strehl and J. Ghosh, Cluster Ensembles ? a Knowledge Reuse Framework for Combining Multiple Partitions, J. Mach. Learn. Res. (JMLR), vol.3, pp.583-617, 2003.

C. Sueur, A. Jacobs, F. Amblard, O. Petit, and A. J. King, How can social network analysis improve the study of primate behavior?, American Journal of Primatology, vol.75, issue.8, pp.703-719, 2011.
DOI : 10.1163/156853980X00447
URL : https://hal.archives-ouvertes.fr/hal-00561345

M. Suh, K. E. Carroll, and N. L. Cassill, Critical review on smart clothing product development, J. Textile and Apparel, vol.6, 2010.

L. Tang and H. Liu, Relational Learning via Latent Social Dimensions A framework for community identification in dynamic social networks, Proc. 15th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data mining (KDD'09) Proc. 13th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data mining (KDD'07), pp.817-826, 2007.

M. Tedder, D. Corneil, M. Habib, and C. Paul, Simpler linear-time modular decomposition via recursive factorizing permutations. Automata, languages and programming, pp.634-645, 2008.
DOI : 10.1007/978-3-540-70575-8_52
URL : http://www.cs.utoronto.ca/~mtedder/TedderModular.pdf

Y. Bibliographie-tian, A. Balmin, S. A. Corsten, S. Tatikonda, and J. Mcpherson, From "Think Like a Vertex" to "Think Like a Graph, Proc. VLDB Endow, pp.193-204, 2013.

P. U. Tournoux, J. Leguay, F. Benbadis, J. Whitbeck, V. Conan et al., Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case, IEEE Transactions on Mobile Computing, vol.10, issue.12, pp.1755-1768, 2011.
DOI : 10.1109/TMC.2010.247
URL : https://hal.archives-ouvertes.fr/hal-01151836

Y. Tseng, S. Ni, Y. Chen, and J. Sheu, The Broadcast Storm Problem in a Mobile Ad Hoc Network, Wireless Networks, vol.8, issue.2/3, pp.153-167, 2002.
DOI : 10.1023/A:1013763825347

T. Van-laarhoven and E. Marchiori, Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means, 2016.

J. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams, Theoretical Computer Science, vol.609, pp.245-252, 2016.
DOI : 10.1016/j.tcs.2015.09.030
URL : https://hal.archives-ouvertes.fr/hal-01112627

T. Viard, Link streams for the modelling of interactions over time and application to the analysis of IP traffic, Thèse de doctorat, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01521029

T. Vicsek, Complexity: The bigger picture, Nature, vol.418, issue.6894, pp.131-131, 2002.
DOI : 10.1038/418131a

S. Wasserman and K. Faust, Social Network Analysis : Methods and Applications, 1994.
DOI : 10.1017/CBO9780511815478

D. J. Watts and S. H. Strogatz, Collective dynamics of ???small-world??? networks, Nature, vol.338, issue.2, pp.440-442, 1998.
DOI : 10.1038/338334a0

J. J. Whang, D. F. Gleich, and I. S. Dhillon, Overlapping community detection using seed set expansion, Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, CIKM '13, pp.2099-2108, 2013.
DOI : 10.1145/2505515.2505535
URL : http://www.cs.utexas.edu/users/inderjit/public_papers/overlapping_commumity_cikm13.pdf

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

J. Xie, B. K. Szymanski, and X. Liu, SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process, 2011 IEEE 11th International Conference on Data Mining Workshops, 2011.
DOI : 10.1109/ICDMW.2011.154

Z. Yakoubi and R. Kanawati, LICOD: A Leader-driven algorithm for community detection in complex networks, Vietnam Journal of Computer Science, vol.33, issue.4, pp.241-256, 2014.
DOI : 10.1086/jar.33.4.3629752

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

G. Youness and G. Saporta, Une méthodologie pour la comparaison de partitions, pp.97-120, 2004.

G. U. Yule, A Mathematical Theory of Evolution, Based on the Conclusions of Dr. J. C. Willis, F.R.S., Philosophical Transactions of the Royal Society B: Biological Sciences, vol.213, issue.402-410, pp.21-87, 1925.
DOI : 10.1098/rstb.1925.0002

W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, 1977.
DOI : 10.1086/jar.33.4.3629752

L. A. Zadeh, Fuzzy sets, Information and Control, vol.8, issue.3, pp.338-353, 1965.
DOI : 10.1016/S0019-9958(65)90241-X

A. Zakrzewska and D. A. Bader, A Dynamic Algorithm for Local Community Detection in Graphs, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, ASONAM '15, pp.559-564, 2015.
DOI : 10.1145/2350190.2350193

H. Zanghi, S. Volant, and C. Ambroise, Clustering based on random graph model embedding vertex features, Pattern Recognition Letters, vol.31, issue.9, pp.830-836, 2010.
DOI : 10.1016/j.patrec.2010.01.026
URL : http://arxiv.org/pdf/0910.2107.pdf

H. Zardi, L. B. Romdhane, and Z. Guessoum, A Multi-agent Homophily-Based Approach for Community Detection in Social Networks, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp.501-505, 2014.
DOI : 10.1109/ICTAI.2014.81
URL : https://hal.archives-ouvertes.fr/hal-01212783

Y. Zhang, J. Wang, Y. Wang, and L. Zhou, Parallel community detection on large networks with propinquity dynamics, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.997-1006, 2009.
DOI : 10.1145/1557019.1557127

Y. Zhao, A survey on theoretical advances of community detection in networks, Wiley Interdisciplinary Reviews: Computational Statistics, vol.45, issue.5, 2017.
DOI : 10.1214/16-AOS1457

K. Zhou, A. Martin, Q. Pan, and . Liu, Median evidential c-means algorithm and its application to community detection. Knowledge-Based Systems, Z.-g, vol.74, pp.69-88, 2015.
DOI : 10.1016/j.knosys.2014.11.010
URL : https://hal.archives-ouvertes.fr/hal-01100902

T. Zhou, L. Lü, and Y. Zhang, Predicting missing links via local information, The European Physical Journal B, vol.30, issue.4, 2009.
DOI : 10.1126/science.1073374
URL : http://arxiv.org/pdf/0901.0553

Y. Zhou, H. Cheng, and J. X. Yu, Graph clustering based on structural/attribute similarities, Proc. 35th Int. Conf. on Very Large DataBases Proc. VLDB Endow, pp.718-729, 2009.
DOI : 10.14778/1687627.1687709
URL : http://www.vldb.org/pvldb/2/vldb09-175.pdf

Z. A. Zhu, S. Lattanzi, and V. Mirrokni, A Local Algorithm for Finding Well- Connected Clusters, Proc. 30th Int. Conf. on Machine Learning (ICML'13), pp.396-404, 2013.

L. ?ubelj and M. Bajec, Robust network community detection using balanced propagation, The European Physical Journal B, vol.74, issue.3, pp.353-362, 2011.
DOI : 10.1103/PhysRevE.74.036104

. Orman, nous détaillons les générateurs de graphes artificiels ou synthétiques (benchmark graphs en anglais) Le manque de graphes tirés de situations réelles, et surtout leur manque de diversité, ont mené à la création de plusieurs méthodes et algorithmes pour obtenir des graphes dont un certain nombre de propriétés sont paramétrables et donc connues, garanties. Bien évidemment, malgré un niveau de perfectionnement croissant au fil des années, ces benchmarks n'arrivent à l'heure actuelle pas encore à reproduire, B.1 Générateurs de graphes Dans cette section, 2013.

. Java, Il dispose d'une boîte à outils relativement complète et extensible par un utilisateur, permettant de générer, exporter, charger, manipuler et visualiser tous types de graphes. La génération se fait par ajout successif d'arêtes, conformément au modèle génératif choisi. Ainsi, GraphStream peut être utilisé pour générer des graphes statiques (état terminal d'une suite finie d'ajouts d'arêtes)