D. Angeli and P. Bliman, Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees, SIAM Journal on Control and Optimization, vol.48, issue.1, pp.1-32625, 2009.
DOI : 10.1137/060673527

URL : https://hal.archives-ouvertes.fr/hal-00793004

G. Andersson, P. Donalek, R. Farmer, N. Hatziargyriou, I. Kamwa et al., Causes of the 2003 Major Grid Blackouts in North America and Europe, and Recommended Means to Improve System Dynamic Performance, IEEE Transactions on Power Systems, vol.20, issue.4, pp.1922-1928, 2005.
DOI : 10.1109/TPWRS.2005.857942

[. Arranz, A. Seuret, C. Canudas-de, and . Wit, Collaborative Estimation of Gradient Direction by a Formation of AUVs, International ICST Conference on Performance Evaluation Methodologies and Tools, p.5, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00610564

M. Ballerini, N. Cabibbo, R. Candelier, A. Cavagna, E. Cisbani et al., Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study, Proceedings of the National Academy of Sciences, pp.1232-1237, 2008.
DOI : 10.1073/pnas.0711437105

M. [. Borgatti and . Everett, Models of core/periphery structures, Social Networks, vol.21, issue.4, pp.375-395, 1999.
DOI : 10.1016/S0378-8733(99)00019-2

M. [. Borgatti and . Everett, A Graph-theoretic perspective on centrality, Social Networks, vol.28, issue.4, pp.466-484, 2006.
DOI : 10.1016/j.socnet.2005.11.005

J. [. Blondel, R. Guillaume, E. Lambiotte, and . Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, pp.10008-194, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008

URL : https://hal.archives-ouvertes.fr/hal-01146070

L. [. Bauso, R. Giarré, and . Pesenti, Non-linear protocols for optimal distributed consensus in networks of dynamic agents, Systems & Control Letters, vol.55, issue.11, pp.918-928, 2006.
DOI : 10.1016/j.sysconle.2006.06.005

D. Bauso, L. Giarre, and R. Pesenti, Dissensus, death and division, 2009 American Control Conference, pp.2307-2312, 2009.
DOI : 10.1109/ACC.2009.5160410

S. [. Bastian, M. Heymann, and . Jacomy, Gephi : An open source software for exploring and manipulating networks, International AAAI Conference on Weblogs and Social Media, pp.361-362, 2009.

J. [. Blondel, A. Hendrickx, J. N. Olshevsky, and . Tsitsiklis, Convergence in Multiagent Coordination, Consensus, and Flocking, Proceedings of the 44th IEEE Conference on Decision and Control, pp.2996-3000, 2005.
DOI : 10.1109/CDC.2005.1582620

P. [. Bonacich and . Lloyd, Eigenvector-like measures of centrality for asymmetric relations, Social Networks, vol.23, issue.3, pp.191-201, 2001.
DOI : 10.1016/S0378-8733(01)00038-7

]. P. Bon72 and . Bonacich, Factoring and weighting approaches to status scores and clique identification, Journal of Mathematical Sociology, vol.2, pp.113-120, 1972.

R. [. Berman and . Plemmons, Nonnegative Matrices in the Mathematical Sciences, Classics in Applied Mathematics, vol.9, p.159, 1979.
DOI : 10.1137/1.9781611971262

S. [. Bermudez and . Wicker, Connectivity of Finite Wireless Networks with Random Communication Range Nodes, 2009 IEEE International Conference on Communications, pp.1-5, 2009.
DOI : 10.1109/ICC.2009.5198844

J. [. Cucker and . Dong, A General Collision-Avoiding Flocking Framework, IEEE Transactions on Automatic Control, vol.56, issue.5, pp.1124-1129, 2011.
DOI : 10.1109/TAC.2011.2107113

C. [. Cormen, R. L. Leiserson, and . Rivest, Introduction to Algorithms, p.74, 1990.

E. [. Cucker and . Mordecki, Flocking in noisy environments, Journal de Math??matiques Pures et Appliqu??es, vol.89, issue.3, pp.278-296, 2008.
DOI : 10.1016/j.matpur.2007.12.002

]. J. Cor08 and . Cortés, Distributed algorithms for reaching consensus on general functions, Automatica, vol.44, issue.3, pp.726-737, 2008.

S. [. Cucker and . Smale, On the mathematics of emergence, Japanese Journal of Mathematics, vol.75, issue.1, pp.197-227, 2007.
DOI : 10.1007/s11537-007-0647-x

L. Cao, Y. Zheng, and Q. Zhou, A necessary and sufficient condition for consensus of continuous-time agents over undirected time-varying networks. tac, pp.1915-1920, 2011.

D. [. Davidson and . Harel, Drawing graphs nicely using simulated annealing, ACM Transactions on Graphics, vol.15, issue.4, pp.301-331, 1996.
DOI : 10.1145/234535.234538

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5663

E. [. Dalmao and . Mordecki, Cucker-Smale Flocking Under Hierarchical Leadership and Random Interactions. ArXiv e-prints, pp.62-63, 2009.
DOI : 10.1137/100785910

URL : http://arxiv.org/abs/0912.4535

Y. [. Eberhart and . Shi, Comparing inertia weights and constriction factors in particle swarm optimization, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), pp.84-88, 2000.
DOI : 10.1109/CEC.2000.870279

S. [. Flom, S. Friedman, A. Strauss, and . Neaigus, A new measure of linkage between two sub-networks, Connections, pp.62-70, 2004.

]. M. Fie73 and . Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, vol.23, issue.2, pp.298-305, 1973.

]. A. Fil88, . M. Filippovfr91-]-t, E. M. Fruchterman, and . Reingold, Differential equations with discontinuous righthand sides Translated from the Russian, Graph Drawing by Force-directed Placement. Software? Practice and Experience, pp.1129-1164, 1988.

]. L. Fre79 and . Freeman, Centrality in social networks : conceptual clarification, Social Networks, vol.1, pp.215-239, 1979.

]. L. Fre80 and . Freeman, The gatekeeper, pair-dependency and structural centrality, Quality and Quantity, vol.14, pp.585-592, 1980.

]. L. Fre91 and . Freeman, Centrality in valued graphs : A measure of betweenness based on network flow, Social Networks, vol.13, issue.2, pp.141-154, 1991.

C. Godsil and G. Royle, Algebraic Graph Theory Les loisirs motorisés hors route, conflits, controverse et réseaux d'actants, Thèse de doctorat, pp.95-140, 2001.

W. [. Hui and . Haddad, Distributed nonlinear control algorithms for network consensus, Automatica, vol.44, issue.9, pp.2375-2381, 2008.
DOI : 10.1016/j.automatica.2008.01.011

Q. Hui, W. M. Haddad, and S. P. Bhat, Finite-time semistability, filippov systems, and consensus protocols for nonlinear dynamical networks with switching topologies. Nonlinear Analysis : Hybrid Systems, pp.557-573, 2010.

C. [. Horn and . Johnson, Matrix Analysis, p.205, 1985.

[. Ha and J. Liu, A simple proof of the Cucker-Smale flocking dynamics and mean-field limit, Communications in Mathematical Sciences, vol.7, issue.2, pp.297-325, 2009.
DOI : 10.4310/CMS.2009.v7.n2.a2

[. Ha, K. Lee, and D. Levy, Emergence of time-asymptotic flocking in a stochastic Cucker-Smale system, Communications in Mathematical Sciences, vol.7, issue.2, pp.453-469, 2009.
DOI : 10.4310/CMS.2009.v7.n2.a9

J. [. Hendrickx and . Tsitsiklis, Convergence of type-symmetric and cut-balanced consensus seeking systems. tac, PP(99) :1, 2012, pp.39-40

J. [. Jadbabaie, A. S. Lin, and . Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules. tac, pp.998-1001, 2003.

]. L. Kat53 and . Katz, A new status index derived from sociometric analysis, Psychometrika, vol.18, pp.39-43, 1953.

C. [. Kirkpatrick, M. P. Gelatt, and . Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

]. H. Kha02 and . Khalil, Nonlinear Systems, p.27, 2002.

S. [. Kamada and . Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, vol.31, issue.1, pp.7-15, 1989.
DOI : 10.1016/0020-0190(89)90102-6

J. [. Kar and . Moura, Sensor Networks With Random Links: Topology Design for Distributed Consensus, IEEE Transactions on Signal Processing, vol.56, issue.7, p.95, 2007.
DOI : 10.1109/TSP.2008.920143

J. G. Kemeny and J. L. Snell, Finite Markov Chains, p.162, 1960.

]. B. Lat05 and . Latour, Reassembling the Social : An Introduction to Actor-network-theory (Clarendon Lectures in Management Studies), p.142, 2005.

L. [. Liu and . Guo, Connectivity and synchronization of vicsek model Science in China Series F : Information Sciences, pp.848-858, 2008.

B. Latour, P. Jensen, T. Venturini, S. Grauwin, and D. Boullier, ???The whole is always smaller than its parts??? - a digital test of Gabriel Tardes' monads, The British Journal of Sociology, vol.5, issue.2, p.142, 2012.
DOI : 10.1111/j.1468-4446.2012.01428.x

X. [. Li, P. Liu, W. Lin, and . Ren, Consensus of linear multi-agent systems with reduced-order observer-based protocols. Systems and Control Letters, pp.510-516, 2011.

M. Abubakr and . Graphs, Simplicial Complexes and Beyond : Topological Tools for Multi-agent Coordination Laplacian matrices of graphs : a survey, Linear Algebra and its Applications, issue.9, pp.197-198143, 1994.

[. Morarescu and A. Girard, Opinion Dynamics With Decaying Confidence: Application to Community Detection in Graphs, IEEE Transactions on Automatic Control, vol.56, issue.8, pp.1862-1873, 2011.
DOI : 10.1109/TAC.2010.2095315

URL : https://hal.archives-ouvertes.fr/hal-00622835

]. L. Mor05 and . Moreau, Stability of multiagent systems with time-dependent communication links, IEEE Trans. Automatic Control, vol.50, issue.30, pp.169-182, 2005.

]. N. Mrr-+-53, A. W. Metropolis, M. N. Rosenbluth, A. H. Rosenbluth, E. Teller et al., Equation of state calculations by fast computing machines, Journal of Chemical Physics, vol.21, pp.1087-1092, 1953.

S. [. Metropolis and . Ulam, The Monte Carlo Method, Journal of the American Statistical Association, vol.44, issue.247, pp.335-341, 1949.
DOI : 10.1080/01621459.1949.10483310

]. M. New03 and . Newman, A measure of betweenness centrality based on random walks. eprint arXiv :cond-mat/0309045, pp.158-162, 2003.

]. R. Os06 and . Olfati-saber, Flocking for multi-agent dynamic systems : Algorithms and theory. tac, pp.401-420, 2006.

R. Olfati-saber, J. A. Fax, and R. M. Murray, Consensus and Cooperation in Networked Multi-Agent Systems, Proceedings of the IEEE, vol.95, issue.1, pp.215-233, 2007.
DOI : 10.1109/JPROC.2006.887293

R. Olfati-saber, J. A. Fax, and R. M. Murray, Consensus and Cooperation in Networked Multi-Agent Systems, Proceedings of the IEEE, vol.95, issue.1, pp.215-233, 2007.
DOI : 10.1109/JPROC.2006.887293

]. R. Osm04a, R. M. Olfati-saber, and . Murray, Consensus problems in networks of agents with switching topology and time-delays, IEEE Trans. Automatic Control, vol.49, issue.40, pp.1520-2533, 2004.

]. R. Osm04b, R. M. Olfati-saber, and . Murray, Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic Control, vol.49, issue.9, pp.1520-1533, 2004.

H. [. Park, S. Kim, and . Ha, Cucker-smale flocking with inter-particle bonding forces. tac, pp.2617-2623, 2010.

R. [. Ren and . Beard, Consensus seeking in multi-agent systems under dynamically changing interaction topologies. tac, pp.655-661, 2005.

W. Ren, R. W. Beard, and E. M. Atkins, A survey of consensus problems in multi-agent coordination. acc, pp.1859-1864, 2005.

]. C. Rey87 and . Reynolds, Flocks, herds, and schools : A distributed behavioral model, Computer Graphics, vol.21, issue.64, pp.25-34, 1987.

R. [. Zhang and . Rousseau, Betweenness centrality and q-measures in directed valued networks, Scientometrics, vol.75, pp.575-590, 2008.

]. A. Sar09 and . Sarlette, Geometry and Symmetries in Coordination Control, p.5, 2009.

C. [. Sundaram and . Hadjicostis, Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies, 2007 American Control Conference, pp.711-716, 2007.
DOI : 10.1109/ACC.2007.4282726

D. [. Tsitsiklis, M. Bertsekas, and . Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Transactions on Automatic Control, vol.31, issue.9, pp.803-812, 1986.
DOI : 10.1109/TAC.1986.1104412

C. [. Traud, P. J. Frost, M. A. Mucha, and . Porter, Visualization of communities in networks, Chaos: An Interdisciplinary Journal of Nonlinear Science, vol.19, issue.4, p.155, 2005.
DOI : 10.1063/1.3194108

J. N. Tsitsiklis, Problems in Decentralized Decision Making and Computation, Laboratory for Information and Decision Systems, p.29, 1984.

A. [. Tahbaz-salehi and . Jadbabaie, On consensus over random networks, cdc, pp.93-95, 2006.

. Vcbj-+-95-]-t, A. Vicsek, E. Czirók, I. Ben-jacob, O. Cohen et al., Novel type of phase transition in a system of self-driven particles, Phys. Rev. Lett, vol.75, issue.6, pp.1226-1229, 1995.

A. [. Vicsek and . Zafeiris, Collective motion. Reviews of Modern Physics, submitted, preprint available

Y. [. Wang and . Hong, Distributed finite-time ??-consensus algorithms for multi-agent systems with variable coupling topology, Journal of Systems Science and Complexity, vol.51, issue.12, pp.209-237, 2010.
DOI : 10.1007/s11424-010-7254-2

J. Wolfowitz, Products of indecomposable, aperiodic, stochastic matrices, Proceedings of the American Mathematical Society, vol.14, issue.5, pp.733-737, 1963.
DOI : 10.1090/S0002-9939-1963-0154756-3

F. [. Wang and . Xiao, Finite-time consensus problems for networks of dynamic agents Automatic Control Heading consensus with collision avoidance for linearized vicsek model with a connected initial graph, Chinese Control Conference, pp.950-955, 2010.

[. Yang, Review of metaheuristics and generalized evolutionary walk algorithm, p.154, 2011.

H. [. Yang, A. Grip, A. A. Saberi, and . Stoorvogel, Output consensus for networks of non-identical, non-introspective agents subject to actuator saturation, acc, jun, p.27, 2012.

A. [. Zavlanos, G. J. Jadbabaie, and . Pappas, Flocking while preserving network connectivity, 2007 46th IEEE Conference on Decision and Control, pp.2919-2924, 2007.
DOI : 10.1109/CDC.2007.4434530

U. Acteur-est-reconnu-comme-interlocuteur-par-un-autre, Ces deux acteurs échangent dans le cadre de simples discussions Discussion dans le cadre de réunions Deux acteurs (ou plus) discutent dans le cadre de réunion de concertation (même si quelqu'un ne prend pas la parole, il est comptabilisé comme ayant ce type de relation car il fait partie de la concertation