Rumor spreading and vertex expansion

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1623-1641

  Giakkoupis, George ^a   Sauerwald, Thomas ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANSION;

EDGE-BASED; HIGH PROBABILITY; NODE GRAPH; RUMOR SPREADING; VERTEX EXPANSIONS;

GRAPH THEORY;

EID: 84860166469     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.129     Document Type: Conference Paper

References (36)

1. J. Adler. Bootstrap percolation. Physica A: Statistical and Theoretical Physics, 171(3):453-470, 1991.
2. M. Ajtai. Recursive construction for 3-regular expanders. Combinatorica, 14(4):379-416, 1994.
3. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
4. L. Babai. Local expansion of vertex-transitive graphs and random generation in finite groups. In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC'91), pages 164-174, 1991.
5. N. Berger, C. Borgs, J. T. Chayes, and A. Saberi. On the spread of viruses on the Internet. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pages 301-310, 2005.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6):2508-2530, 2006. (Pubitemid 43898906)
7. K. Censor-Hillel and H. Shachnai. Fast information spreading in graphs with large weak conductance. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA'11), pages 440-448, 2011.
8. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumor spreading in social networks. In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP'09), pages 375-386, 2009.
9. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds for rumour spreading with conductance. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC'10), pages 399-408, 2010.
10. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumour spreading and graph conductance. In Proceedings of the 21th ACM-SIAM Symposium on Discrete Algorithms (SODA'10), pages 1657-1663, 2010.
11. F. R. K. Chung and P. Tetali. Isoperimetric inequalities for cartesian products of graphs. Combinatorics, Probability & Computing, 7(2):141-148, 1998.
12. A. Czumaj and C. Sohler. Testing expansion in bounded-degree graphs. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS'07), pages 570-578, 2007.
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-SIGOPT Symposium on Principles of Distributed Computing (PODC'87), pages 1-12, 1987.
14. 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 (STOC'11), pages 21-30, 2011.
15. R. Elsässer and T. Sauerwald. Broadcasting vs. mixing and information dissemination on cayley graphs. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), pages 163-174, 2007.
16. R. Elsässer and T. Sauerwald. Cover time and broadcast time. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), pages 373-384, 2009.
17. S. Eubank, H. Guclu, V. A. Kumar, M. V. Marathe, A. Srinivasan, Z. Toroczkai, and N. Wang. Modelling disease outbreaks in realistic urban social networks. Nature, 429:180-184, 2004. (Pubitemid 38656193)
18. S. Eubank, V. A. Kumar, M. V. Marathe, A. Srinivasan, and N. Wang. Structure of social contact networks and their impact on epidemics. AMS-DIMACS Special Issue on Epidemiology, 2006.
19. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
20. N. Fountoulakis, A. Huber, and K. Panagiotou. Reliable broadcasting in random networks and the effect of density. In Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM'10), pages 2552-2560, 2010.
21. N. Fountoulakis and K. Panagiotou. Rumor spreading on random regular graphs and expanders. In Proceedings of the 14th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'10), pages 560-573, 2010.
22. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985. (Pubitemid 15475455)
23. G. Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS'11), pages 57-68, 2011.
24. M. Harchol-Balter, F. T. Leighton, and D. Lewin. Resource discovery in distributed networks. In Proceedings of the 18th ACM-SIGOPT Symposium on Principles of Distributed Computing (PODC99), pages 229-237, 1999.
25. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4):439-561, 2006. (Pubitemid 44448254)
26. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS'00), pages 565-574, 2000.
27. J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), pages 631-636, 2006.
28. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In Proceedings of the 17th International Conference on World Wide Web (WWW'08), pages 695-704, 2008.
29. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty, 2:1-46, 1993.
30. A. S. Maiya and T. Y. Berger-Wolf. Sampling community structure. In Proceedings of the 19th International Conference on World Wide Web (WWW'10), pages 701-710, 2010.
31. C. McDiarmid. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, pages 1-46. Springer, 1998.
32. M. Mihail, C. H. Papadimitriou, and A. Saberi. On certain connectivity properties of the internet topology. J. Comput. Syst. Sci., 72(2):239-251, 2006. (Pubitemid 43255275)
33. D. Mosk-Aoyama and D. Shah. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, 54(7):2997-3007, 2008.
34. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
35. T. Sauerwald and A. Stauffer. Rumor spreading and vertex expansion on regular graphs. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA'11), pages 462-475, 2011.
36. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proceedings of the 15th IFIP International Conference on Distributed Systems Platforms (Middleware'98), pages 55-70, 1998.