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

K. Censor-hillel, B. Haeupler, J. A. Kelner, and P. Maymounkov, Global computation in a poorly connected world, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.961-970, 2012.
DOI : 10.1145/2213977.2214064

K. Censor-hillel and H. Shachnai, Partial information spreading with application to distributed maximum coverage, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.161-170, 2010.
DOI : 10.1145/1835698.1835739

K. Censor-hillel and H. Shachnai, Fast information spreading in graphs with large weak conductance, Proc. 22nd SODA, pp.440-448, 2011.

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Proc. 36th ICALP, pp.375-386, 2009.

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

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumour spreading and graph conductance, Proc. 21st SODA, pp.1657-1663, 2010.
DOI : 10.1137/1.9781611973075.135
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.5903

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, Proc. 6th PODC, pp.1-12, 1987.

B. Doerr, M. Fouz, and T. Friedrich, Social networks spread rumors in sublogarithmic time, Proc. 43rd STOC, pp.21-30, 2011.

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.57-66, 2001.
DOI : 10.1145/502512.502525

P. Devdatt, A. Dubhashi, and . Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms, 2009.

R. Elsässer and T. Sauerwald, Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs, Proc. 24th STACS, pp.163-174, 2007.
DOI : 10.1007/978-3-540-70918-3_15

S. Eubank, H. Guclu, V. S. Kumar, M. V. Marathe, A. Srinivasan et al., Modelling disease outbreaks in realistic urban social networks, Nature, vol.202, issue.6988, pp.180-184, 2004.
DOI : 10.1103/PhysRevE.68.026121

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

N. 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

N. Fountoulakis and K. Panagiotou, Rumor spreading on random regular graphs and expanders, Proc. 14th RANDOM, pp.560-573, 2010.

N. Fountoulakis, K. Panagiotou, and T. Sauerwald, Ultra-Fast Rumor Spreading in Social Networks, Proc. 23rd SODA, pp.1642-1660, 2012.
DOI : 10.1137/1.9781611973099.130

A. Frieze and G. 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

G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, Proc. 28th STACS, pp.57-68, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573638

G. Giakkoupis and T. Sauerwald, Rumor Spreading and Vertex Expansion, Proc. 23rd SODA, pp.1623-1641, 2012.
DOI : 10.1137/1.9781611973099.129
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.8395

B. Haeupler, Simple, fast and deterministic gossip and rumor spreading, Proc. 24th SODA, pp.705-716, 2013.
DOI : 10.1145/2767126
URL : http://arxiv.org/abs/1210.1193

D. Kempe and J. Kleinberg, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.695-704, 2008.
DOI : 10.1145/1367497.1367591

D. 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

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

T. Sauerwald and A. Stauffer, Rumor Spreading and Vertex Expansion on Regular Graphs
DOI : 10.1137/1.9781611973082.37