R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574, 2000.
DOI : 10.1109/SFCS.2000.892324
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.6813

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Automata, Languages and Programming, pp.375-386, 2009.

K. Censor-hillel and H. Shachnai, Fast information spreading in graphs with large weak conductance, Proc. ACM-SIAM SODA, 2011.

H. Amini, M. Draief, and M. Lelarge, Flooding in Weighted Random Graphs, Proc. SIAM ANALCO, pp.1-15, 2011.
DOI : 10.1137/1.9781611973013.1
URL : https://hal.archives-ouvertes.fr/hal-00793055

G. Kossinets, J. Kleinberg, and D. Watts, The structure of information pathways in a social communication network, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 08, pp.435-443, 2008.
DOI : 10.1145/1401890.1401945

L. Backstrom, E. Bakshy, J. Kleinberg, T. M. Lento, and I. Rosenn, Center of attention: How facebook users allocate attention across friends, Proc. 5th ICWSM, 2011.

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

S. Ioannidis, A. Chaintreau, and L. Massoulié, Optimal and Scalable Distribution of Content Updates over a Mobile Social Network, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.1422-1430, 2009.
DOI : 10.1109/INFCOM.2009.5062058