Ultra-fast rumor spreading in social networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1642-1660

  Fountoulakis, Nikolaos ^a   Panagiotou, Konstantinos ^b   Sauerwald, Thomas ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS PROTOCOLS; ASYNCHRONOUS VERSION; CONSTANT TIME; HIGH PROBABILITY; POISSON PROCESS; POWER LAW DEGREE DISTRIBUTION; PUSH-PULL PROTOCOLS; RUMOR SPREADING;

ALGORITHMS;

EID: 84860123097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.130     Document Type: Conference Paper

References (29)

1. www.internetworldstats.com.
2. J.P. Bagrow, D. Wang and A. Barabási, Collective Response of Human Populations to Large-Scale Emergencies, PLoS ONE, 6 (2011), e17680.
3. B. Bollobás, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs, Random Structures Algorithms, 31 (2007), pp. 3-122.
4. S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, 52 (2006), pp. 2508-2530.
5. J. Candia, M.C. González, P. Wang, T. Schoenhar, G. Madey and A. Barabási, Uncovering individual and collective human dynamics from mobile phone records, J. Phys. A: Math. Theor., 41 (2008), 224015.
6. K. Censor-Hillel and H. Shachnai, Partial information spreading with application to distributed maximum coverage, in Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, 2010, pp. 161-170.
7. F. Chierichetti, S. Lattanzi and A. Panconesi, Rumor Spreading in Social Networks, in Proceedings of the 36th International Colloquium on Automata, Languages and Programming, 2009, pp. 375-386.
8. F. Chierichetti, S. Lattanzi and A. Panconesi, Almost tight bounds for rumour spreading with conductance, in Proceedings of the 42nd Symposium on the Theory of Computing, 2010, pp. 399-408.
9. F. Chierichetti, S. Lattanzi and A. Panconesi, Rumour spreading and graph conductance, in Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms, 2010, pp. 1657-1663.
10. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Annals of Combinatorics, 6 (2002), pp. 125-145.
11. F. Chung and L. Lu, The Average Distance in a Random Graph with Given Expected Degrees, Internet Mathematics, 1 (2003), pp. 91-113.
12. F. Chung L. Lu and V. Vu, The spectra of random graphs with given expected degrees, Proc Natl Acad Sci U S A.,100 (2003), pp. 6313-6318.
13. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart and D. Terry, Epidemic algorithms for replicated database maintenance, In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 1-12.
14. S. Dereich and C. Mönch and P. Mörtens, Typical distances in ultrasmall random networks, 2011 (available at http://arxiv.org/abs/1102.5680).
15. B. Doerr, M. Fouz and T. Friedrich, Social Networks Spread Rumors in Sublogarithmic Time, In Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 21-30.
16. R. Elsässer, On Randomized Broadcasting in Power Law Networks, In Proceedings of the 20th Symposium on Distributed Computing, 2006, pp. 370-384.
17. M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the Internet topology, In Proceedings of the SIGCOM Conference on Applications, Technologies, Architectures and Protocols for Computer Communication, 1999, pp. 251-262.
18. G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, In Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science, 2011, pp. 57-68.
19. B. Haeupler, Analyzing Network Coding Gossip Made Easy, In Proceedings of the 43rd Symposium on the Theory of Computing, 2011, pp. 293-302.
20. U. Kang, C.E. Tsourakakis, A.P. Appel, C. Faloutsos, J. Leskovec, HADI: Mining Radii of Large Graphs, ACM Trans. Knowl. Discov. Data, 5 (2011), pp. 1-24.
21. R. Karp, C. Schindelhauer, S. Shenker and B. Vöcking, Randomized Rumor Spreading, In Proceedings of the 41st IEEE Symposium on the Foundations of Computer Science, 2000, pp. 565-574.
22. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions, Internet Mathematics, 1 (2004), pp. 226-251.
23. D. Mosk-Aoyama and D. Shah, Fast Distributed Algorithms for Computing Separable Functions, IEEE Transactions on Information Theory, 54 (2008), pp. 2997-3007.
24. M. E. J. Newman, Power Laws, Pareto Distributions and Zipfs Law, Contemporary Physics, 46 (2005), pp. 323-351.
25. I. Norros and H. Reittu, On a conditionally Poissonian graph process, Adv. in Appl. Probab., 38 (2006), pp. 59-275.
26. T. Sauerwald, On mixing and edge expansion properties in randomized broadcasting, Algorithmica, 56 (2010), pp. 51-88.
27. B. Söderberg, General formalism for inhomogeneous random graphs, Phys. Rev. E (3), 66 (2002), 066121.
28. E. Upfal and M. Mitzenmacher, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press, 2005.
29. R. van der Hofstad, Random Graphs and Complex Networks, 2011, (manuscript available at www.win.tue.nl/rhofstad/NotesRGCN2011.pdf).