D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, 2002.
DOI : 10.1007/bf01048272

V. Auletta, I. Caragiannis, D. Ferraioli, C. Galdi, and G. Persiano, Minority Becomes Majority in Social Networks, Proc. WINE '15, pp.74-88, 2015.
DOI : 10.1007/978-3-662-48995-6_6
URL : https://doi.org/10.1007/978-3-662-48995-6_6

I. Benjamini, S. Chan, R. O'donnell, O. Tamuz, and L. Tan, Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs. CoRR, abs/1405.2486, 2014.
DOI : 10.1016/j.spa.2016.02.015
URL : http://arxiv.org/pdf/1405.2486

E. Berger, Dynamic Monopolies of Constant Size, Journal of Combinatorial Theory, Series B, vol.83, issue.2, pp.191-200, 2001.

S. Brahma, S. Macharla, S. P. Pal, and S. K. Singh, Fair Leader Election by Randomized Voting, Proc. ICDCIT '04, pp.22-31, 2004.
DOI : 10.1007/978-3-540-30555-2_4

F. Bénézit, P. Thiran, and M. Vetterli, Interval consensus: From quantized gossip to voting, Proc. ICASSP '09, pp.3661-3664, 2009.

L. Cardelli and A. Csikász-nagy, The Cell Cycle Switch Computes Approximate Majority. Scientific Reports, vol.2, issue.656, 2012.

F. Chierichetti, J. M. Kleinberg, and S. Oren, On Discrete Preferences and Coordination, Proc. EC '13, pp.233-250, 2013.

C. Cooper, R. Elsässer, H. Ono, and T. Radzik, Coalescing Random Walks and Voting on Connected Graphs, SIAM Journal on Discrete Mathematics, vol.27, issue.4, pp.1748-1758, 2013.

G. Cordasco and L. Gargano, Community Detection via Semi-Synchronous Label Propagation Algorithms, Proc. BASNA '10, pp.1-8, 2010.
DOI : 10.1109/basna.2010.5730298
URL : http://arxiv.org/abs/1103.4550

A. Cournier and M. Habib, A New Linear Algorithm for Modular Decomposition, Proc. 19th Colloquium on Trees in Algebra and Programming (CAAP '94), pp.68-84, 1994.

X. Deng and C. Papadimitriou, On the Complexity of Cooperative Solution Concepts, 14 On the Voting Time of the Deterministic Majority Process, vol.19, pp.257-266, 1994.

P. Donnelly and D. Welsh, Finite particle systems and infection models, Mathematical Proceedings of the Cambridge Philosophical Society, vol.94, issue.01, pp.167-182, 1983.

D. Doty, Timing in Chemical Reaction Networks, Proc. SODA '14, pp.772-784, 2014.

S. Frischknecht, B. Keller, and R. Wattenhofer, Convergence in (Social) Influence Networks, Proc. DISC '13, pp.433-446, 2013.

D. Gifford, Weighted Voting for Replicated Data, Proc. SOSP '79, pp.150-162, 1979.

E. Goles, Local Graph Transformations Driven by Lyapunov Functionals, Complex Systems, vol.3, issue.1, pp.173-184, 1989.

E. Goles and S. Martínez, Neural and Automata Networks, 1990.

E. Goles and A. M. Odlyzko, Decreasing Energy Functions and Lengths of Transients for Some Cellular Automata, Complex Systems, vol.2, issue.5, pp.501-507, 1988.

E. Goles and J. Olivos, Periodic behaviour of generalized threshold functions, Discrete Mathematics, vol.30, issue.2, pp.187-189, 1980.

E. Goles-chacc, F. Fogelman-soulié, and D. Pellegrin, Decreasing energy functions as a tool for studying threshold networks, Discrete Applied Mathematics, vol.12, issue.3, pp.261-277, 1985.

Y. Hassin and D. Peleg, Distributed Probabilistic Polling and Applications to Proportionate Agreement. Information and Computation, vol.171, pp.248-268, 2001.

R. Holley and T. Liggett, Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model, The Annals of Probability, vol.3, issue.4, pp.643-663, 1975.

, Design & Analysis of Fault Tolerant Digital Systems, 1989.

D. Kaaser, F. Mallmann-trenn, and E. Natale, Brief Announcement: On the Voting Time of the Deterministic Majority Process, Proc. DISC '15, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01207836

D. Kaaser, F. Mallmann-trenn, and E. Natale, On the Voting Time of the Deterministic Majority Process. CoRR, abs/1508.03519, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02001816

B. Keller, D. Peleg, and R. Wattenhofer, How Even Tiny Influence Can Have a Big Impact! In, Proc. FUN '14, pp.252-263, 2014.

K. Kothapalli, S. Pemmaraju, and V. Sardeshmukh, On the Analysis of a Label Propagation Algorithm for Community Detection, Proc. ICDCN '13, pp.255-269, 2013.

N. Lanchier and C. Neuhauser, Voter model and biased voter model in heterogeneous environments, Journal of Applied Probability, vol.44, issue.3, pp.770-787, 2007.

T. Liggett, Interacting Particle Systems, 1985.

F. Mallmann-trenn, Bounds on the voting time in terms of the conductance. Master's thesis, 2014.

E. Mossel and O. Tamuz, Opinion Exchange Dynamics. CoRR, abs/1401, vol.4770, 2014.

R. Oliveira, On the coalescence time of reversible random walks, Transactions of the American Mathematical Society, vol.364, issue.4, pp.2109-2128, 2012.

D. Peleg, Local majorities, coalitions and monopolies in graphs: a review, Theoretical Computer Science, vol.282, issue.2, pp.231-257, 2002.

D. Peleg, Immunity against Local Influence, Language, vol.8001, pp.168-179, 2014.

S. Poljak and M. S?ra, On periodical behaviour in societies with symmetric influences, Combinatorica, vol.3, issue.1, pp.119-121, 1983.

S. Poljak and D. Turzík, On an application of convexity to discrete systems, Discrete Applied Mathematics, vol.13, issue.1, pp.27-32, 1986.

U. Raghavan, R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks, Physical Review E, vol.76, issue.3, p.15, 2007.

A. Sar?yüce, E. Saule, K. Kaya, and U. Çatalyürek, Shattering and Compressing Networks for Betweenness Centrality, Proc. SDM '13, pp.686-694, 2013.

O. Tamuz and R. J. Tessler, Majority Dynamics and the Retention of Information, Israel Journal of Mathematics, vol.206, issue.1, pp.483-507, 2015.

P. Winkler, Puzzled: Delightful Graph Theory, Communications of the ACM, vol.51, issue.8, p.104, 2008.

P. Winkler, Puzzled: Solutions and Sources, Communications of the ACM, vol.51, issue.9, p.103, 2008.