]. Y. Aab-+-11, N. Afek, O. Alon, E. Barad, N. Hornstein et al., A biological solution to a fundamental distributed computing problem, Science, vol.331, issue.6014, pp.183-185, 2011.

J. Aad-+-06a]-d.-angluin, Z. Aspnes, M. J. Diamadi, R. Fischer, and . Peralta, Computation in networks of passively mobile finite-state sensors. Distributed computing, vol.18, pp.235-253, 2006.

J. Aad-+-06b]-dana-angluin, Z. Aspnes, M. J. Diamadi, and . Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, 2006.

, For example, their eigenvector computation algorithm has distinct averaging and orthogonalization phases

D. Angluin, J. Aspnes, and D. Eisenstat, A simple population protocol for fast robust approximate majority, Preliminary version in DISC'07), vol.21, pp.87-102, 2008.

D. Alistarh, J. Aspnes, D. Eisenstat, R. Gelashvili, and R. L. Rivest, Time-space Trade-offs in Population Protocols, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pp.2560-2579, 2017.

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol.3, issue.4, p.13, 2008.

D. Alistarh, J. Aspnes, and R. Gelashvili, Space-Optimal Majority in Population Protocols, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, pp.2221-2239, 2018.

E. Abbe, S. Afonso, G. Bandeira, and . Hall, Exact recovery in the stochastic block model, IEEE Trans. on Information Theory, vol.62, issue.1, pp.471-487, 2014.

N. Alon and F. R. Chung, Explicit construction of linear sized tolerant networks, Discrete Mathematics, vol.72, issue.1, pp.15-19, 1988.

D. Aldous and J. Fill, Reversible markov chains and random walks on graphs, 1995.

D. Angluin, M. J. Fischer, and H. Jiang, Stabilizing consensus in mobile networks, Proceedings of Distributed Computing in Sensor Systems (DCOSS'06), vol.4026, pp.37-50, 2006.

D. Alistarh and R. Gelashvili, Polylogarithmic-time leader election in population protocols, Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming, vol.9135, pp.479-491, 2015.

D. Alistarh, R. Gelashvili, and M. Vojnovi?, Fast and Exact Majority in Population Protocols, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, 2015.

D. Aldous, Interacting particle systems as stochastic social dynamics, Bernoulli, vol.19, issue.4, pp.1122-1149, 2013.

J. Aspnes and E. Ruppert, An introduction to population protocols, Bulletin of the EATCS, vol.93, pp.98-117, 2007.

H. Attiya and J. Welch, Distributed computing: fundamentals, simulations, and advanced topics, vol.19, 2004.

J. Beauquier, J. Burman, and S. Kutten, A self-stabilizing transformer for population protocols with covering, Theoretical Computer Science, vol.412, issue.33, pp.4247-4259, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00531379

. +-17]-petra, A. E. Berenbrink, R. Clementi, P. Elsässer, F. Kling et al., Ignore or comply?: On breaking symmetry in consensus, Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, PODC'17, pp.335-344, 2017.

. Bcm-+-18]-luca, A. E. Becchetti, P. Clementi, E. Manurangsi, F. Natale et al., Average whenever you meet: Opportunistic protocols for community detection, 26th Annual European Symposium on Algorithms, ESA 2018, vol.7, pp.1-7, 2018.

]. L. +-15, A. Becchetti, E. Clementi, F. Natale, R. Pasquale et al., Plurality consensus in the gossip model, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'15), pp.371-390, 2015.

]. L. +-16, A. Becchetti, E. Clementi, F. Natale, L. Pasquale et al., Stabilizing consensus with many opinions, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'16, 2016.

]. L. +-17a, A. Becchetti, E. Clementi, F. Natale, R. Pasquale et al., Simple dynamics for plurality consensus. Distributed Computing (Ext. Abs. in ACM SPAA'14), vol.30, pp.293-306, 2017.

[. Bcn-+-17b, ]. L. Becchetti, A. Clementi, E. Natale, F. Pasquale et al., Find your place: Simple distributed algorithms for community detection, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pp.940-959, 2017.

. +-17c]-luca, A. Becchetti, E. Clementi, F. Natale, P. Pasquale et al., Friend or foe? population protocols can perform community detection, 2017.

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, pp.2508-2530, 2006.

F. Bénézit, P. Thiran, and M. Vetterli, Interval consensus: From quantized gossip to voting, Proceedings of the 34th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '09, pp.3661-3664, 2009.

F. Benezit, P. Thiran, and M. Vetterli, The Distributed Multiple Voting Problem, IEEE Journal of Selected Topics in Signal Processing, vol.5, issue.4, pp.791-804, 2011.

A. E. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, F. Pasquale et al., Rumor spreading in random evolving graphs. Random Struct, Algorithms, vol.48, issue.2, pp.290-312, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00922696

L. Cardelli and A. Csikász-nagy, The cell cycle switch computes approximate majority, Scientific Reports, vol.2, 2012.

S. Cannon, J. J. Daymude, D. Randall, and A. W. Richa, A markov chain algorithm for compression in self-organizing particle systems, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pp.279-288

C. Cooper, R. Elsasser, and T. Radzik, The power of two choices in distributed voting, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP'14), vol.8573, pp.435-446, 2014.

]. C. +-15, R. Cooper, T. Elsässer, N. Radzik, T. Rivera et al., Fast consensus for voting on general expander graphs, Distributed Computing: 29th International Symposium, (DISC '15), pp.248-262, 2015.

M. Clementi, L. Ghaffari, F. Gualà, E. Natale, G. Pasquale et al., A tight analysis of the parallel undecided-state dynamics with two colors, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02002476

A. Clementi, L. Gualà, F. Pasquale, and G. Scornavacca, Brief announcement: On the parallel undecided-state dynamics with two colors, 31st International Symposium on Distributed Computing, vol.47, pp.1-47, 2017.

B. Chazelle, Natural algorithms and influence systems, Commun. ACM, vol.55, issue.12, pp.101-110, 2012.

A. E. Clementi, M. D. Ianni, G. Gambosi, E. Natale, and R. Silvestri, Distributed community detection in dynamic graphs, Theor. Comput. Sci, vol.584, pp.19-41, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02002648

Y. Chang, T. Kopelowitz, and S. Pettie, An exponential separation between randomized and deterministic complexity in the LOCAL model, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pp.615-624, 2016.

L. Cardelli, M. Z. Kwiatkowska, and M. Whitby, Chemical Reaction Network Designs for Asynchronous Logic Circuits, pp.67-81, 2016.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Almost tight bounds for rumour spreading with conductance, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp.399-408, 2010.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Theoretical Computer Science, vol.412, issue.24, pp.2602-2610, 2011.

E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, Phase transition of the 2-choices dynamics on core-periphery networks, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '18, pp.777-785, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02002658

E. Cruciani, E. Natale, and G. Scornavacca, Distributed Community Detection via Metastability of the 2-Choices Dynamics, AAAI 2019 -Thirty-Third AAAI Conference Association for the Advancement of Artificial Intelligence, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02002462

A. Coja-oghlan, Graph partitioning via adaptive spectral techniques. Combinatorics, Probability and Computing, vol.19, pp.227-284, 2010.

S. Colin, T. Cooper, N. Radzik, T. Rivera, and . Shiraga, Fast plurality consensus in regular expanders, DISC, 2017.

M. Cook, D. Soloveichik, E. Winfree, and J. Bruck, Programmability of chemical reaction networks, Algorithmic Bioprocesses, pp.543-584, 2009.

Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler et al., Brief announcement: Amoebot -a new model for programmable matter, Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14), pp.220-222, 2014.

M. H. Degroot, Reaching a consensus, Journal of the American Statistical Association, vol.69, issue.345, pp.118-121, 1974.

D. Doty and M. Eftekhari, Othon Michail, Paul G Spirakis, and Michail Theofilatos, Exact size counting in uniform population protocols in nearly logarithmic time, 2018.

M. E. Dyer and A. M. Frieze, The solution of some random NP-hard problems in polynomial expected time, Journal of Algorithms, vol.10, issue.4, pp.451-489, 1989.

]. A. +-87, D. Demers, C. Greene, W. Hauser, J. Irish et al., Epidemic algorithms for replicated database maintenance, Proceedings of the 6th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'12), pp.1-12, 1987.

]. B. +-11, L. A. Doerr, L. Goldberg, T. Minder, C. Sauerwald et al., Stabilizing consensus with the power of two choices, Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), pp.149-158, 2011.

D. Dolev and E. N. Hoch, On self-stabilizing synchronous actions despite byzantine attacks, Proceedings of the International Symposium on Distributed Computing (DISC'07), pp.193-207, 2007.

E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM, vol.17, issue.11, pp.643-644, 1974.

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

S. Dolev, R. I. Kat, and E. Schiller, When consensus meets self-stabilization, J. Comput. Syst. Sci, vol.76, issue.8, pp.884-900, 2010.

S. Dolev, Self-stabilization, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. Dolev, Self-Stabilization, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00627780

D. Doty, Timing in chemical reaction networks, Proceedings of 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pp.772-784, 2014.

M. Draief and M. Vojnovic, Convergence speed of binary interval consensus, SIAM Journal on Control and Optimization, vol.50, issue.3, pp.1087-1109, 2012.

. Efk-+-17]-robert, T. Elsässer, D. Friedetzky, F. Kaaser, H. Mallmann-trenn et al., Brief announcement: Rapid asynchronous plurality consensus, Proceedings of the 36th Annnual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, (PODC'17) (full version at ArXive, pp.363-365, 2017.

O. Feinerman, B. Haeupler, and A. Korman, Breathe before speaking: Efficient information dissemination despite noisy, limited and anonymous communication, Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '14), pp.114-123, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01672280

O. Feinerman, B. Haeupler, and A. Korman, Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, Distributed Computing, pp.1-17, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01672280

N. E. Friedkin and E. C. Johnsen, Social influence and opinions, The Journal of Mathematical Sociology, vol.15, issue.3-4, pp.193-206, 1990.

O. Feinerman and A. Korman, Theoretical distributed computing meets biology: A review, International Conference on Distributed Computing and Internet Technology, pp.1-18, 2013.

P. Fraigniaud, A. Korman, and D. Peleg, Towards a complexity theory for local distributed computing, Journal of the ACM (JACM), vol.60, issue.5, p.35, 2013.

P. Fraigniaud and E. Natale, Noisy rumor spreading and plurality consensus, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC'16), pp.127-136, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01423686

]. N. +-02, S. C. Franks, E. B. Pratt, N. F. Mallon, D. J. Britton et al., Information flow, opinion polling and collective intelligence in house-hunting social insects, Philosophical Transactions of the Royal Society of London B: Biological Sciences, vol.357, pp.1567-1583, 1427.

G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, Symposium on Theoretical Aspects of Computer Science (STACS'11), pp.57-68, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00573638

M. Ghaffari and J. Lengler, Nearly-tight analysis for 2-choice and 3-majority consensus dynamics, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (PODC'18), pp.305-313, 2018.

R. Hegselmann and U. Krause, Opinion dynamics driven by various ways of averaging, Comput. Econ, vol.25, issue.4, pp.381-405, 2005.

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

M. Jerrum and G. B. Sorkin, The metropolis algorithm for graph bisection, Discrete Applied Mathematics, vol.82, issue.1, pp.155-175, 1998.

M. Richard and . Karp, Understanding science through the computational lens, Journal of Computer Science and Technology, vol.26, issue.4, pp.569-577, 2011.

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pp.482-491, 2003.

]. F. +-13, C. Krzakala, E. Moore, J. Mossel, A. Neeman et al., Spectral redemption in clustering sparse networks, Proceedings of the National Academy of Sciences, vol.110, issue.52, pp.20935-20940, 2013.

F. Varun-kanade, T. Mallmann-trenn, and . Sauerwald, On Coalescence Time in Graphs: When is Coalescing As Fast As Meeting?, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '19, pp.956-965, 2019.

N. Kang and N. Rivera, Best-of-three voting on dense graphs, The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '19, pp.115-121, 2019.

S. Pavel-l-krapivsky, E. Redner, and . Ben-naim, A Kinetic View of Statistical Physics, 2010.

R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science (FOCS'00), pp.565-574, 2000.

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

. James-r-lee, L. Shayan-oveis-gharan, and . Trevisan, Multiway spectral partitioning and higher-order cheeger inequalities, Journal of the ACM (JACM), issue.6, p.37, 2014.

T. Liggett, Interacting particle systems, vol.276, 2012.

X. Liu and T. Murata, Advanced modularity-specialized label propagation algorithm for detecting communities in networks, Physica A: Statistical Mechanics and its Applications, vol.389, issue.7, pp.1493-1500, 2010.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.

F. Mcsherry, Spectral partitioning of random graphs, Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS'01), pp.529-537, 2001.

G. B. Mertzios, S. E. Nikoletseas, C. Raptopoulos, and P. G. Spirakis, Determining majority in networks with local interactions and very small local memory, Automata, Languages, and Programming -41st International Colloquium, ICALP 2014, pp.871-882, 2014.

G. Mertzios, S. Nikoletseas, C. Raptopoulos, and P. Spirakis, Determining majority in networks with local interactions and very small local memory, Distributed Computing (Ext.Abs. in ICALP'14, p.30, 2016.

E. Mossel, J. Neeman, and A. Sly, Reconstruction and estimation in the planted partition model. Probability Theory and Related Fields, vol.162, pp.431-461, 2014.

E. Mossel, J. Neeman, and O. Tamuz, Majority dynamics and aggregation of information in social networks, Autonomous Agents and Multi-Agent Systems, vol.28, issue.3, pp.408-429, 2014.

E. Mossel and G. Schoenebeck, Reaching consensus on social networks, Proceedings of the 2nd Innovations in Computer Science (ITCS'10), pp.214-229, 2010.

F. Mallmann-trenn, C. Musco, and C. Musco, Eigenvector computation and community detection in asynchronous gossip models, 2018.

S. Navlakha, Z. Bar, and -. , Distributed information processing in biological and computational systems, Communications of the ACM, vol.58, issue.1, pp.94-102, 2015.

E. Oja, Simplified neuron model as a principal component analyzer, Journal of mathematical biology, vol.15, issue.3, pp.267-273, 1982.

A. Olshevsky and J. N. Tsitsiklis, Convergence speed in distributed consensus and averaging, SIAM Journal on Control and Optimization, vol.48, issue.1, pp.33-55, 2009.

D. Peleg, Distributed computing. SIAM Monographs on discrete mathematics and applications, vol.5, 2000.

M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.

M. O. Rabin, Randomized byzantine generals, Proceedings of the 24th Annual Symposium on Foundations of Computer Science (SFCS'83), pp.403-409, 1983.

B. Reus, Molecular Computing, pp.299-316, 2016.

I. Ramezani and E. Natale, On the Necessary Memory to Compute the Plurality in Multi-Agent Systems, CIAC'19 -11th International Conference on Algorithms and Complexity, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02002448

D. Shah, Gossip algorithms, 2009.

S. Salehkaleybar, A. Sharif-nassab, and S. J. Golestani, Distributed Voting/Ranking with Optimal Number of States per Node, IEEE Transactions on Signal and Information Processing over Networks, issue.99, pp.1-1, 2015.

A. Joel and . Tropp, User-friendly tail bounds for sums of random matrices, Foundations of computational mathematics, vol.12, issue.4, pp.389-434, 2012.

P. Tetali and P. Winkler, Simultaneous reversible Markov chains, Combinatorics: Paul Erdós Is Eighty, vol.1, pp.433-451, 1993.

S. Wolfram, A New Kind of Science, Wolfram media Champaign, vol.5, 2002.

L. Xiao, S. Boyd, and S. Kim, Distributed average consensus with least-mean-square deviation, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.33-46, 2007.