Abstract
Motivated by the recent emergence of the so-called opportunistic communication networks, we consider the issue of adaptivity in the most basic continuous time (asynchronous) rumor spreading process. In our setting a rumor has to be spread to a population; the service provider can push it at any time to any node in the network and has unit cost for doing this. On the other hand, as usual in rumor spreading, nodes share the rumor upon meeting and this imposes no cost on the service provider. Rather than fixing a budget on the number of pushes, we consider the cost version of the problem with a fixed deadline and ask for a minimum cost strategy that spreads the rumor to every node. A non-adaptive strategy can only intervene at the beginning and at the end, while an adaptive strategy has full knowledge and intervention capabilities. Our main result is that in the homogeneous case (where every pair of nodes randomly meet at the same rate) the benefit of adaptivity is bounded by a constant. This requires a subtle analysis of the underlying random process that is of interest in its own right.
Supported by the Millennium Nucleus Information and Coordination in Networks ICM/FIC RC130003, CONICYT via Basal in Applied Mathematics, and an NWO Veni grant.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andersson, H., Britton, T.: Stochastic Epidemic Models and Their Statistical Analysis. Lecture Notes in Statistics. Springer, New York (2000)
Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 477–489. Springer, Heidelberg (2008)
Bailey, N.: A simple stochastic epidemic. Biometrika 37, 193–202 (1950)
Barry, K.: Ford bets the fiesta on social networking, September 2009. www.wired.com/2009/04/how-the-fiesta/
Bartlett, M.: An Introduction to Stochastic Processes, with Special Reference to Methods and Applications. Cambridge University Press, Cambridge (1978)
Bollobás, B., Kohayakawa, Y.: On Richardson’s model on the hypercube. In: Bollobás, B., Thomason, A. (eds.) Combinatorics, Geometry and Probability. Cambridge University Press, Cambridge (1997)
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA (2014)
Boyd, S., Arpita, G., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)
Chen, N.: On the approximability of influence in social networks. In: SODA (2008)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD (2010)
Chen, Y., Krause, A.: Near-optimal batch mode active learning and adaptive submodular optimization. In: ICML (2013)
Cisco: VNI: Global mobile data traffic forecast update, 2013–2018 (2014). www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/white_paper_c11-520862.html. Accessed 28 October 2014
Doerr, B., Künnemann, M.: Tight analysis of randomized rumor spreading in complete graphs. In: ANALCO (2014)
Domingos, P., Richardson, M.: Mining the network value customers. In: KDD (2001)
Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427–486 (2011)
Grimmett, G.: Probability on Graphs: Random Processes on Graphs and Lattices. Cambridge University Press, Cambridge (2010). Institute of Mathematical Statistics Textbooks
Han, B., Hui, P., Kumar, A., Marathe, M., Pei, G., Srinivasan, A.: Cellular traffic offloading through opportunistic communications: a case study. In: CHANTS (2010)
Horel, T., Singer, Y.: Scalable methods for adaptively seeding a social network. In: WWW (2015)
Ioannidis, S., Chaintreau, A., Massoulie, L.: Optimal and scalable distribution of content updates over a mobile social network. In: IEEE INFOCOM (2009)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: SIGKDD (2003)
Kempe, D., Kleinberg, J., Tardos, E.: Influential nodes in a diffusion model. In: ICALP (2005)
Kleinberg, J.: Cascading behavior in social and economic networks. In: ACM EC (2013)
Sciancalepore, V., Giustiniano, D., Banchs, A., Picu, A.: Offloading cellular traffic through opportunistic communications: analysis and optimization. ArXiv preprint 1405.3548 (2014)
Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: FOCS (2013)
Whitbeck, J., Amorim, M., Lopez, Y., Leguay, J., Conan, V.: Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays. In: WOWMOM (2011)
Acknowledgments
We thank Albert Banchs, Antonio Fernández, Domenico Giustiniano, Nicole Immorlica, Julia Komjáthy, Brendan Lucier, and Yaron Singer for stimulating discussions and helpful pointers to the literature.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correa, J., Kiwi, M., Olver, N., Vera, A. (2015). Adaptive Rumor Spreading. In: Markakis, E., Schäfer, G. (eds) Web and Internet Economics. WINE 2015. Lecture Notes in Computer Science(), vol 9470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48995-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-662-48995-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48994-9
Online ISBN: 978-3-662-48995-6
eBook Packages: Computer ScienceComputer Science (R0)