A. Mohammed-amin and M. Draief, Majority consensus on random graphs of a given degree sequence. CoRR, abs/1209, vol.5025, 2012.

A. Mohammed-amin and M. Draief, Global majority consensus by local majority polling on graphs of a given degree sequence, Discrete Applied Mathematics, vol.180, pp.1-10, 2015.

A. Aggarwal, V. Dani, T. P. Hayes, and J. Saia, Distributed computing with channel noise. IACR Cryptology ePrint Archive, p.710, 2017.

A. Noga-alon, N. Bar-noy, D. Linial, and . Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences, vol.43, issue.2, pp.290-298, 1991.

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and P. René, Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, pp.235-253, 2006.

D. Angluin, J. Aspnes, and D. Eisenstat, A Simple Population Protocol for Fast Robust Approximate Majority, Distributed Computing, vol.21, issue.2, pp.87-102, 2008.

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

J. Aspnes and E. Ruppert, An Introduction to Population Protocols, pp.97-120, 2009.
DOI : 10.1007/978-3-540-89707-1_5
URL : http://cs-www.cs.yale.edu/homes/aspnes/beatcs-population-protocols.pdf

C. Avin and R. Elsässer, Breaking the log n barrier on rumor spreading. Distributed Computing, 2017.

R. Bar-yehuda, O. Goldreich, and A. Itai, On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences, vol.45, issue.1, pp.104-126, 1992.

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and R. Silvestri, Plurality consensus in the gossip model, ACM-SIAM SODA'15, pp.371-390, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02002629

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and R. Silvestri, Plurality Consensus in the Gossip Model, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA '15, pp.371-390
URL : https://hal.archives-ouvertes.fr/hal-02002629

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan, Stabilizing consensus with many opinions, Proc. of the 27th Ann. ACM-SIAM Symp. on Discrete algorithms, pp.620-635, 2016.
DOI : 10.1137/1.9781611974331.ch46
URL : https://hal.archives-ouvertes.fr/hal-02002615

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, R. Silvestri et al., Simple dynamics for plurality consensus, ACM SPAA'14, pp.247-256, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02002640

P. Berenbrink, A. Clementi, P. Kling, R. Elsässer, F. Mallmann-trenn et al., Ignore or comply? on breaking symmetry in consensus, ACM PODC'17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02002544

L. Boczkowski, O. Feinerman, A. Korman, and E. Natale, Limits for Rumor Spreading in Stochastic Populations, Proc. of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics (LIPIcs), vol.49, pp.1-49, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01958152

L. Boczkowski, E. Natale, O. Feinerman, and A. Korman, Limits on reliable information flows through stochastic populations, PLOS Computational Biology, vol.14, issue.6, p.1006195, 2018.
DOI : 10.1371/journal.pcbi.1006195
URL : https://hal.archives-ouvertes.fr/hal-01953778

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE/ACM Transactions on Networking, vol.14, pp.2508-2530, 2006.
DOI : 10.1109/tit.2006.874516
URL : http://www.stanford.edu/~boyd/papers/pdf/gossip.pdf

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

K. Censor-hillel, R. Gelles, and B. Haeupler, Making asynchronous distributed computations robust to noise, 2017.
DOI : 10.1007/s00446-018-0343-5
URL : http://arxiv.org/pdf/1702.07403

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

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumour spreading and graph conductance, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, pp.1657-1663, 2010.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Almost Tight Bounds for Rumour Spreading with Conductance, Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC '10, pp.399-408, 2010.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Selected Papers from 36th International Colloquium on Automata, Languages and Programming, vol.412, pp.2602-2610, 2009.

G. Chockler, M. Demirbas, S. Gilbert, N. Lynch, C. Newport et al., Consensus and collision detectors in radio networks, Distributed Computing, vol.21, issue.1, pp.55-84, 2008.

A. E. Clementi, L. Gualà, F. Pasquale, G. Scornavacca, E. Natale et al., A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors, Leibniz International Proceedings in Informatics (LIPIcs). Schloss DagstuhlLeibniz-Zentrum fuer Informatik, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02002476

A. E. Clementi, A. Monti, F. Pasquale, and R. Silvestri, Broadcasting in dynamic radio networks, Previ0us Version in ACM PODC'07, vol.75, pp.213-230, 2009.

A. E. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '01, pp.709-718, 2001.

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.

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, ACM PODC'87, 1987.

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

B. Doerr, C. Doerr, S. Moran, and S. Moran, Simple and optimal randomized fault-tolerant rumor spreading, Distributed Computing, vol.29, issue.2, pp.89-104, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01327397

B. Doerr and M. Fouz, Quasi-random rumor spreading: Reducing randomness can be costly, Information Processing Letters, vol.111, issue.5, pp.227-230, 2011.

B. Doerr, T. Friedrich, and T. Sauerwald, Quasirandom Rumor Spreading. ACM Trans. Algorithms, vol.11, issue.2, p.35, 2014.

B. Doerr, L. A. Goldberg, and L. Minder, Thomas Sauerwald, and Christian Scheideler. Stabilizing consensus with the power of two choices, ACM SPAA'11, pp.149-158, 2011.

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

D. Doty, Timing in chemical reaction networks, ACM-SIAM SODA'14, pp.772-784, 2014.

A. E. Gamal, Open problems, Workshop on specific problems in communication and computation, 1984.

B. Ofer-feinerman, A. Haeupler, and . Korman, Breathe Before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication. Distributed Computing, Ext. Abs. in ACM PODC'14, vol.30, issue.5, pp.239-355, 2017.

P. Fraigniaud and E. Natale, Noisy rumor spreading and plurality consensus, Distributed Computing, pp.1-20, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01423686

N. R. Franks, S. C. Pratt, E. B. Mallon, N. F. Britton, and D. J. Sumpter, 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.

A. M. Frieze and G. R. Grimmett, The shortest-path problem for graphs with random arclengths, Discrete Applied Mathematics, vol.10, issue.1, pp.57-77, 1985.

G. Emanuele, A. Fusco, and . Pelc, Communication Complexity of Consensus in Anonymous Message Passing Systems, Fundam. Inf, vol.137, issue.3, pp.305-322, 2015.

R. G. Gallager, Finding parity in a simple broadcast network, IEEE Trans. Inf. Theor, vol.34, issue.2, pp.176-180, 2006.

M. Ghaffari and J. Lengler, Tight analysis for the 3-majority consensus dynamics, 2017.

M. Ghaffari and M. Parter, A Polylogarithmic Gossip Algorithm for Plurality Consensus, Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, PODC '16, pp.117-126, 2016.

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

G. Giakkoupis, Tight Bounds for Rumor Spreading with Vertex Expansion, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '14, pp.801-815
URL : https://hal.archives-ouvertes.fr/hal-01097140

G. Giakkoupis, Y. Nazari, and P. Woelfel, How asynchrony affects rumor spreading time, 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353698

G. Giakkoupis and T. Sauerwald, Rumor Spreading and Vertex Expansion, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, SODA '12, pp.1623-1641, 2012.

N. Goyal, G. Kindler, and M. Saks, Lower bounds for the noisy broadcast problem, SIAM J. Comput, vol.37, issue.6, pp.1806-1841, 2008.

B. Haeupler, Simple, fast and deterministic gossip and rumor spreading, J. ACM, vol.62, issue.6, 2015.

B. Haeupler and D. Malkhi, Optimal gossip with direct addressing, Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC '14, pp.176-185, 2014.

R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, IEEE FOCS'00, pp.565-574, 2000.

D. R. Kowalski and A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, The 43rd Annual IEEE Symposium on Foundations of Computer Science, pp.63-72, 2002.

F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa, Broadcasting in unreliable radio networks, Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC '10, pp.336-345, 2010.

F. Kuhn, N. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC '10, pp.513-522, 2010.

E. Kushilevitz and Y. Mansour, An ?(d log(n/d)) lower bound for broadcast in radio networks, SIAM Journal on Computing, vol.27, issue.3, pp.702-712, 1998.

A. Nancy and . Lynch, Distributed algorithms, 1996.

J. C. David and . Mackay, Information theory, inference, and learning algorithms, 2003.

G. B. Mertzios, S. E. Nikoletseas, C. Raptopoulos, and P. G. Spirakis, Determining majority in networks with local interactions and very small local memory, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP'14), 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.

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

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.

E. Perron, D. Vasudevan, and M. Vojnovic, Using Three States for Binary Consensus on Complete Graphs, IEEE INFOCOM'09, pp.2527-1535, 2009.

B. Pittel, On Spreading a Rumor, SIAM J. Appl. Math, vol.47, issue.1, pp.213-223, 1987.

O. Michael and . Rabin, Randomized byzantine generals, Proc. of the 24th Ann. Symp. on Foundations of Computer Science (SFCS), pp.403-409, 1983.

N. Santoro and P. Widmayer, Time is Not a Healer, Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89, pp.304-313, 1989.

, Devavrat Shah. Gossip Algorithms. Foundations and Trends R in Networking, vol.3, issue.1, pp.1-125, 2007.