A. Acan, A. Collevecchio, A. Mehrabian, and N. Wormald, On the push&pull protocol for rumour spreading, 1411.
DOI : 10.1145/2767386.2767416

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

T. J. Norman and . Bailey, The mathematical theory of epidemics, 1957.

[. Berger, C. Borgs, J. T. Chayes, and A. Saberi, On the spread of viruses on the internet, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.301-310, 2005.

A. Brach, A. Epasto, P. Panconesi, and . Sankowski, Spreading rumours without the network, Proceedings of the second edition of the ACM conference on Online social networks, COSN '14, pp.107-118, 2014.
DOI : 10.1145/2660460.2660472

P. Stephen, A. Boyd, B. Ghosh, D. Prabhakar, and . Shah, Randomized gossip algorithms, IEEE Trans. Information Theory, vol.52, pp.2508-2530, 2006.

[. Bollobás and O. Riordan, Robustness and Vulnerability of Scale-Free Random Graphs, Internet Mathematics, vol.1, issue.1, pp.1-35, 2003.
DOI : 10.1080/15427951.2004.10129080

E. F. Andrea, P. Clementi, C. Crescenzi, P. Doerr, F. Fraigniaud et al., Rumor spreading in random evolving graphs, Random Structures and Algorithms, vol.48, pp.290-312, 2016.

[. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pp.375-386, 2009.
DOI : 10.1007/978-3-642-02930-1_31

[. 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 '10, pp.399-408, 2010.
DOI : 10.1145/1806689.1806745

[. Doerr, M. Fouz, and T. Friedrich, Social networks spread rumors in sublogarithmic time, Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp.21-30, 2011.
DOI : 10.1016/j.endm.2011.09.050

[. Doerr, M. Fouz, and T. Friedrich, Asynchronous Rumor Spreading in Preferential Attachment Graphs, Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp.307-315, 2012.
DOI : 10.1007/978-3-642-31155-0_27
URL : http://www.mpi-inf.mpg.de/~tfried/paper/2012SWAT.pdf

[. Doerr, M. Fouz, and T. Friedrich, Experimental Analysis of Rumor Spreading in Social Networks, Proceedings of the Design and Analysis of Algorithms -First Mediterranean Conference on Algorithms (MedAlg), pp.159-173, 2012.
DOI : 10.1007/978-3-642-34862-4_12

[. Doerr, M. Fouz, and T. Friedrich, Why rumors spread so quickly in social networks, Communications of the ACM, vol.55, issue.6, pp.70-75, 2012.
DOI : 10.1145/2184319.2184338

[. Doerr, T. Friedrich, and T. Sauerwald, Quasirandom rumor spreading, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.773-781, 2008.
DOI : 10.1145/2650185
URL : http://dl.acm.org/ft_gateway.cfm?id=2650185&type=pdf

A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.1-12, 1987.
DOI : 10.1145/41840.41841

[. Doerr, A. Huber, and A. Levavi, Strong robustness of randomized rumor spreading protocols, Discrete Applied Mathematics, vol.161, issue.6, pp.778-793, 2013.
DOI : 10.1016/j.dam.2012.10.014
URL : http://arxiv.org/abs/1001.3056

[. Doerr and M. Künnemann, Tight Analysis of Randomized Rumor Spreading in Complete Graphs, Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.82-91, 2014.
DOI : 10.1137/1.9781611973204.8

[. Doerr and A. Kostrygin, Randomized rumor spreading revisited, Automata, Languages, and Programming -44th International Colloquium, p.page to appear, 2017.

G. Dkm-+-10-]-alexandros, S. Dimakis, . Kar, M. F. José, M. G. Moura et al., Gossip algorithms for distributed signal processing, Proceedings of the IEEE, vol.98, pp.1847-1864, 2010.

[. Daum, F. Kuhn, and Y. Maus, Rumor Spreading with Bounded In-Degree, 1506.
DOI : 10.1007/BF01645980
URL : https://hal.archives-ouvertes.fr/hal-01207841

M. Eden, A two-dimensional growth process, Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability Contributions to Biology and Problems of Medicine, pp.223-239, 1961.

R. Elsässer and T. Sauerwald, On the runtime and robustness of randomized broadcasting, Theoretical Computer Science, vol.410, issue.36, pp.3414-3427, 2009.
DOI : 10.1016/j.tcs.2008.04.017

A. M. Frieze and G. R. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Applied Mathematics, vol.10, issue.1, pp.57-77, 1985.
DOI : 10.1016/0166-218X(85)90059-9
URL : https://doi.org/10.1016/0166-218x(85)90059-9

[. Fatès and L. Gerin, Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems, J. Cellular Automata, vol.4, pp.323-337, 2009.
DOI : 10.1007/978-3-540-79992-4_24

[. Flajolet, L. Danì-ele-gardy, and . Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

[. Fountoulakis, A. Huber, and K. Panagiotou, Reliable Broadcasting in Random Networks and the Effect of Density, 2010 Proceedings IEEE INFOCOM, pp.2552-2560, 2010.
DOI : 10.1109/INFCOM.2010.5462084

[. Fountoulakis and K. Panagiotou, Rumor spreading on random regular graphs and expanders, 13th International BIBLIOGRAPHY Workshop on Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques (APPROX), pp.560-573
DOI : 10.1007/978-3-642-15369-3_42
URL : http://arxiv.org/abs/1002.3518

D. Feige, P. Peleg, E. Raghavan, and . Upfal, Randomized broadcast in networks, Random Structures and Algorithms, vol.47, issue.4, pp.447-460, 1990.
DOI : 10.1002/rsa.3240010406

[. Fountoulakis, K. Panagiotou, and T. Sauerwald, Ultra-Fast Rumor Spreading in Social Networks, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1642-1660, 2012.
DOI : 10.1137/1.9781611973099.130
URL : http://siam.omnibooksonline.com/2012SODA/data/papers/433.pdf

G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, 28th International Symposium on Theoretical Aspects of Computer Science (STACS) Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 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), pp.801-815, 2014.
DOI : 10.1137/1.9781611973402.59
URL : https://hal.archives-ouvertes.fr/hal-01097140

J. Ayalvadi, A. Ganesh, L. Kermarrec, and . Massoulié, Peer-to-peer membership management for gossip-based protocols, IEEE Trans. Computers, vol.52, pp.139-149, 2003.

W. Goffman and V. A. Newill, Generalization of Epidemic Theory: An Application to the Transmission of Ideas, Nature, vol.204, issue.4955, pp.225-228, 1964.
DOI : 10.1038/204225a0

H. Gaston and . Gonnet, Expected length of the longest probe sequence in hash code searching, pp.289-304, 1981.

G. Giakkoupis and T. Sauerwald, Rumor Spreading and Vertex Expansion, Proceedings of the Twenty-Third Annual ACM- SIAM Symposium on Discrete Algorithms (SODA), pp.1623-1641, 2012.
DOI : 10.1137/1.9781611973099.129
URL : http://siam.omnibooksonline.com/2012SODA/data/papers/310.pdf

K. Iwanicki and M. Van-steen, Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.4, pp.562-576, 2010.
DOI : 10.1109/TPDS.2009.89

S. Janson, One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights, Combinatorics, Probability and Computing, vol.8, issue.4, pp.347-361, 1999.
DOI : 10.1017/S0963548399003892

A. Marcos, C. Kiwi, and . Caro, FIFO queues are bad for rumor spreading, IEEE Trans. Information Theory, vol.63, pp.1159-1166, 2017.

[. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.482-491, 2003.
DOI : 10.1109/SFCS.2003.1238221
URL : http://www-rcf.usc.edu/~dkempe/publications/aggregation.ps

J. M. Kleinberg, The convergence of social and technological networks, Communications of the ACM, vol.51, issue.11, pp.66-72, 2008.
DOI : 10.1145/1400214.1400232

A. [. Kermack and . Mckendrick, A Contribution to the Mathematical Theory of Epidemics, Containing Papers of a Mathematical and Physical Character, pp.700-721, 1927.
DOI : 10.1098/rspa.1927.0118

F. Valentin, B. A. Kolchin, V. P. Sevastianov, A. V. Chistiakov, . V. Balakrishnan et al., Random allocations, 1978.

M. Richard, C. Karp, S. Schindelhauer, B. Shenker, and . Vöcking, Randomized rumor spreading, Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp.565-574, 2000.

[. Mehrabian and A. Pourmiri, Randomized rumor spreading in poorly connected small-world networks, Proceedings of the 28th International Symposium on Distributed Computing (DISC), pp.346-360, 2014.
DOI : 10.1007/978-3-662-45174-8_24

[. Malkhi, O. Rodeh, M. K. Reiter, and Y. Sella, Efficient update diffusion in byzantine environments, Proceedings 20th IEEE Symposium on Reliable Distributed Systems, pp.90-98, 2001.
DOI : 10.1109/RELDIS.2001.969758
URL : http://www.cs.huji.ac.il/~ysella/./papers/srds01_fin3.ps

[. Mosk-aoyama and D. Shah, Computing separable functions via gossip, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.113-122, 2006.
DOI : 10.1145/1146381.1146401
URL : http://arxiv.org/pdf/cs/0504029v3.pdf

[. Mosk-aoyama and D. Shah, Fast Distributed Algorithms for Computing Separable Functions, IEEE Transactions on Information Theory, vol.54, issue.7, pp.2997-3007, 2008.
DOI : 10.1109/TIT.2008.924648
URL : http://arxiv.org/pdf/cs/0504029

V. Matos, P. Schiavoni, R. Felber, E. Oliveira, and . Riviere, BRISA: Combining Efficiency and Reliability in Epidemic Data Dissemination, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.983-994, 2012.
DOI : 10.1109/IPDPS.2012.92
URL : http://gsd.di.uminho.pt/members/mm/papers/2012/brisa-ipdps.pdf

B. Pittel, On Spreading a Rumor, SIAM Journal on Applied Mathematics, vol.47, issue.1, pp.213-223, 1987.
DOI : 10.1137/0147013

[. Panagiotou, A. Pourmiri, and T. Sauerwald, Faster Rumor Spreading with Multiple Calls, The Electronic Journal of Combinatorics, vol.22, pp.1-23, 2015.
DOI : 10.1007/978-3-642-45030-3_42
URL : http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v22i1p23/pdf/

D. Richardson, Random growth in a tessellation, Mathematical Proceedings of the Cambridge Philosophical Society, vol.IV, issue.03, pp.515-528, 1973.
DOI : 10.1017/S0305004100077288

R. Stoica, D. R. Morris, M. F. Karger, H. Kaashoek, and . Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, SIGCOMM, pp.149-160, 2001.
DOI : 10.1109/tnet.2002.808407
URL : http://pdos.lcs.mit.edu/chord/papers/paper-ton.ps

[. Tang, Z. Xu, and S. Dwarkadas, Peer-topeer information retrieval using self-organizing semantic overlay networks, Proceedings of the ACM Conference on Applications, Technologies , Architectures, and Protocols for Computer Communication (SIGCOMM), pp.175-186, 2003.
DOI : 10.1145/863955.863976
URL : http://www.cs.rochester.edu/u/sarrmor/publications/pSearch-SIGCOMM03.ps

S. Voulgaris, A. Kermarrec, L. Massoulié, and M. Van-steen, Exploiting semantic proximity in peer-to-peer content searching, Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004., pp.238-243, 2004.
DOI : 10.1109/FTDCS.2004.1316622
URL : http://www.inf.ethz.ch/personal/spyros/papers/ftdcs.04.pdf