Jungseul Ok
ABSTRACT
A variety of models have been proposed and analyzed to understand how a new innovation (e.g., a technology, a product, or even a behavior) diffuses over a social network, broadly classified into either of epidemic-based or game-based ones. In this paper, we consider a game-based model, where each individual makes a selfish, rational choice in terms of its payoff in adopting the new innovation, but with some noise. We study how diffusion effect can be maximized by seeding a subset of individuals (within a given budget), i.e., convincing them to pre-adopt a new innovation. In particular, we aim at finding `good' seeds for minimizing the time to infect all others, i.e., diffusion speed maximization. To this end, we design polynomial-time approximation algorithms for three representative classes, Erdőos-Réenyi, planted partition and geometrically structured graph models, which correspond to globally well-connected, locally well-connected with large clusters and locally well-connected with small clusters, respectively, provide their performance guarantee in terms of approximation and complexity. First, for the dense Erdős-Rényi and planted partition graphs, we show that an arbitrary seeding and a simple seeding proportional to the size of clusters are almost optimal with high probability. Second, for geometrically structured sparse graphs, including planar and d-dimensional graphs, our algorithm that (a) constructs clusters, (b) seeds the border individuals among clusters, and (c) greedily seeds inside each cluster always outputs an almost optimal solution. We validate our theoretical findings with extensive simulations under a real social graph. We believe that our results provide new practical insights on how to seed over a social network depending on its connection structure, where individuals rationally adopt a new innovation. To our best knowledge, we are the first to study such diffusion speed maximization on the game-based diffusion, while the extensive research efforts have been made in epidemic-based models, often referred to as influence maximization.
- http://tuvalu.santafe.edu/~aaronc/courses/5352/.Google Scholar
- R. M. Anderson and R. M. May. Infectious Diseases of Humans. Oxford University Press, 1991.Google Scholar
- N. T. J. Bailey. The Mathematical Theory of Infectious Diseases and Its Applications. Hafner Press, 1975.Google Scholar
- S. Banerjee, A. Gopalan, A. K. Das, and S. Shakkottai. Epidemic spreading with external agents. arXiv preprint arXiv:1206.3599, 2012.Google Scholar
- L. E. Blume. The statistical mechanics of strategic interaction. Games and Economic Behavior, 5(3):387--424, 1993.Google ScholarCross Ref
- D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos. Epidemic thresholds in real networks. ACM Transactions on Infroamtion and System Security, 10(4):13:1--13:25, 2005. Google ScholarDigital Library
- K. Chaudhuri, F. C. Graham, and A. Tsiatas. Spectral clustering of graphs with general degrees in the extended planted partition model. Journal of Machine Learning Research-Proceedings Track, 23:35--1, 2012.Google Scholar
- W. Chen, W. Lu, and N. Zhang. Time-critical influence maximization in social networks with time-delayed diffusion process. In Proc. of AAAI, 2012.Google Scholar
- W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proc. of ACM SIGKDD, 2010. Google ScholarDigital Library
- J. S. Coleman, E. Katz, H. Menzel, et al. Medical innovation: A diffusion study. Bobbs-Merrill Company New York, NY, 1966.Google Scholar
- E. Coupechoux and M. Lelarge. Impact of clustering on diffusions and contagions in random networks. In Proc. of IEEE NetGCooP, 2011.Google Scholar
- P. Domingos and M. Richardson. Mining the network value of customers. In Proc. of ACM SIGKDD, 2001. Google ScholarDigital Library
- M. Draief and A. Ganesh. A random walk model for infection on graphs: spread of epidemics rumours with mobile agents. Discrete Event Dynamic Systems, 21(1):41--61, Mar. 2011. Google ScholarDigital Library
- G. Ellison. Learning, local action, and coordination. Econometrica, 61(5):1047--1071, Sep. 1993.Google Scholar
- A. Ganesh, L. Massouli, and D. Towsley. The effect of network topology on the spread of epidemics. In Proc. of IEEE Infocom, 2003.Google Scholar
- A. Goyal, F. Bonchi, L. V. S. Lakshmanan, and S. Venkatasubramanian. On minimizing budget and time in influence propagation over social networks. Social Network Analysis and Mining, pages 1--14, 2013.Google ScholarCross Ref
- H. W. Hethcote. The mathematics of infectious diseases. SIAM review, 42(4):599--653, 2000. Google ScholarDigital Library
- J. Hu, K. Meng, X. Chen, C. Lin, and J. Huang. Analysis of influence maximization in large-scale social networks. In Proc. of ACM SIGMETRICS, 2013.Google Scholar
- N. Immorlica, J. Kleinberg, M. Mahidian, and T. Wexler. The role of compatibility in the diffusion of technologies through social networks. In Proc. of ACM EC, 2007. Google ScholarDigital Library
- E. Ising. Beitrag zur theorie des ferromagnetismus. Zeitschrift für Physik A Hadrons and Nuclei, 31(1):253--258, 1925.Google Scholar
- Y. Jin, J. Ok, Y. Yi, and J. Shin. On the impact of global information on diffusion of innovations over social networks. In Proc. of IEEE Infocom NetSci, 2013.Google ScholarCross Ref
- K. Jung. Approximate inference: decomposition methods with applications to networks. PhD thesis, Massachusetts Institute of Technology, 2009. Google ScholarDigital Library
- M. Kandori, G. J. Mailath, and R. Rob. Learning, mutation, and long run equilibria in games. Econometrica, 61(1):29--56, Jan. 1993.Google ScholarCross Ref
- D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proc. of ACM SIGKDD, 2003. Google ScholarDigital Library
- D. Kempe, J. Kleinberg, and E. Tardos. Influential nodes in a diffusion model for social networks. In Proc. of Intl. Colloq. on Automata, Languages and Programming, pages 1127--1138. Springer, 2005. Google ScholarDigital Library
- W. O. Kermack and A. G. McKendrick. Contributions to the mathematical theory of epidemics. ii. the problem of endemicity. In Proc. of the Royal society of London. Series A, 1932.Google Scholar
- M. Lelarge. Coordination in network security games. In Proc. of INFOCOM, 2012.Google ScholarCross Ref
- M. Lelarge. Diffusion and cascading behavior in random networks. Games and Economic Behavior, 75(2):752--775, 2012.Google ScholarCross Ref
- S. Liu, L. Ying, and S. Shakkottai. Influence maximization in social networks: An ising-model-based approach. In Proc. of IEEE Allerton, 2010.Google ScholarCross Ref
- J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In Proc. of NIPS, 2012.Google Scholar
- D. McFadden. Chapter 4: Conditional logit analysis of qualitative choice behavior in Frontiers in Econometrics. Academic Press, New York, 1973.Google Scholar
- R. D. McKelvey and T. R. Palfrey. Quantal response equilibria for normal form games. Games and Economic Behavior, 10(1):6--38, 1995.Google ScholarCross Ref
- A. Montanari and A. Saberi. Convergence to equilibrium in local interaction games. In Proc. of IEEE FOCS, 2009. Google ScholarDigital Library
- D. Mookherjee and B. Sopher. Learning behavior in an experimental matching pennies game. Games and Economic Behavior, 7(1):62--91, 1994.Google ScholarCross Ref
- S. Morris. Contagion. The Review of Economic Studies, 67(1):57--78, 2000.Google ScholarCross Ref
- G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functionsâĂŤi. Mathematical Programming, 14(1):265--294, 1978.Google ScholarDigital Library
- P. Netrapalli and S. Sanghavi. Learning the graph of epidemic cascades. In Proc. of ACM SIGMETRICS, 2012. Google ScholarDigital Library
- E. J. Neves and R. H. Schonmann. Behavior of droplets for a class of glauber dynamics at very low temperature. Probability theory and related fields, 91(3--4):331--354, 1992.Google Scholar
- E. Olivieri and M. E. Vares. Large Deviations and Metastability. Cambridge University Press, 2005.Google ScholarCross Ref
- E. M. Rogers. Diffusion of innovations. Free Press 1962.Google Scholar
- M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105(4):1118--1123, 2008.Google ScholarCross Ref
- D. Strang and S. A. Soule. Diffusion in organizations and social movements: From hybrid corn to poison pills. Annual review of sociology, 24:265--290, 1998.Google Scholar
- H. P. Young. Individual strategy and social structure: An evolutionary theory of institutions. Princeton University Press, 1998.Google Scholar
Index Terms
- On maximizing diffusion speed in social networks: impact of random seeding and clustering
Recommendations
On maximizing diffusion speed in social networks: impact of random seeding and clustering
Performance evaluation reviewA variety of models have been proposed and analyzed to understand how a new innovation (e.g., a technology, a product, or even a behavior) diffuses over a social network, broadly classified into either of epidemic-based or game-based ones. In this paper,...
On Maximizing Diffusion Speed Over Social Networks With Strategic Users
A variety of models have been proposed and analyzed to understand how a new innovation e.g., a technology, a product, or even a behavior diffuses over a social network, broadly classified into either of epidemic-based or game-based ones. In this paper, ...
A Diffusion Model for Maximizing Influence Spread in Large Networks
Social InformaticsAbstractInfluence spread is an important phenomenon that occurs in many social networks. Influence maximization is the corresponding problem of finding the most influential nodes in these networks. In this paper, we present a new influence diffusion model,...
Comments