How to schedule a cascade in an arbitrary graph

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2012, Pages 355-368

  Chierichetti, Flavio ^a   Kleinberg, Jon ^a   Panconesi, Alessandro ^b  

^a School of Operations Research and Information Engineering   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

contagion; diffusion; herding; information cascades

Indexed keywords

ARBITRARY GRAPHS; ARBITRARY NETWORKS; CONTAGION; HERDING; HIGHLY-CORRELATED; PERFORMANCE BOUNDS; SOCIAL NETWORKS;

ALGORITHMS; DIFFUSION;

ELECTRONIC COMMERCE;

EID: 84863508681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2229012.2229040     Document Type: Conference Paper

References (17)

1. ACEMOGLU, D., DAHLEH, M. A., LOBEL, I., AND OZDAGLAR, A. to appear. Bayesian learning in social networks. Review of Economic Studies.
2. ARTHUR, W. B. 1989. Competing technologies, increasing returns, and lock-in by historical events. The Economic Journal 99, 394, 116-131.
3. BANERJEE, A. 1992. A simple model of herd behavior. Quarterly Journal of Economics 107, 797-817.
4. BIKHCHANDANI, S., HIRSHLEIFER, D., AND WELCH, I. 1992. A theory of fads, fashion, custom and cultural change as information cascades. Journal of Political Economy 100, 992-1026.
5. BLUME, L., EASLEY, D., KLEINBERG, J., KLEINBERG, R., AND TARDOS, É. 2011. Which networks are least susceptible to cascading failures? In Proc. 52nd IEEE Symposium on Foundations of Computer Science.
6. CENTOLA, D. AND MACY, M. 2007. Complex contagions and the weakness of long ties. American Journal of Sociology 113, 702-734.
7. DODDS, P. AND WATTS, D. 2004. Universal behavior in a generalized model of contagion. Physical Review Letters 92, 218701.
8. DOMINGOS, P. AND RICHARDSON, M. 2001. Mining the network value of customers. In Proc. 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 57-66.
9. HARTLINE, J. D., MIRROKNI, V. S., AND SUNDARARAJAN, M. 2008. Optimal marketing strategies over social networks. In WWW. 189-198.
10. JANSON, S., ŁUCZAK, T., AND RUCIŃSKI, A. 2000. Random graphs. Wiley-Interscience series in discrete mathematics and optimization. John Wiley.
11. KEMPE, D., KLEINBERG, J., AND TARDOS, É. 2003. Maximizing the spread of influence in a social network. In Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 137-146.
12. MITZENMACHER, M. AND UPFAL, E. 2005. Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press.
13. MOSSEL, E. AND ROCH, S. 2007. On the submodularity of influence in social networks. In Proc. 39th ACM Symposium on Theory of Computing.
14. RICHARDSON, M. AND DOMINGOS, P. 2002. Mining knowledge-sharing sites for viral marketing. In Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 61-70.
15. SALGANIK, M., DODDS, P., AND WATTS, D. 2006. Experimental study of inequality and unpredictability in an artificial cultural market. Science 311, 854-856.
16. WATTS, D. J. 2002. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA 99, 9, 5766-5771.
17. ZUCKERMAN, D. 2007. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 1, 103-128.