• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Maximizing the Spread of Influence Through a Social Network (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www-rcf.usc.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.csd.uwo.ca]
  • [www.cs.cornell.edu]
  • [www.distcomp.ethz.ch]
  • [wireless.cs.uh.edu]
  • [disco.ethz.ch]
  • [distcomp.ethz.ch]
  • [dcg.ethz.ch]
  • [www.dcg.ethz.ch]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by David Kempe
Venue:In KDD
Citations:262 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Kempe03maximizingthe,
    author = {David Kempe},
    title = {Maximizing the Spread of Influence Through a Social Network},
    booktitle = {In KDD},
    year = {2003},
    pages = {137--146},
    publisher = {ACM Press}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of “word of mouth ” in the promotion of new products. Recently, motivated by the design of viral marketing strategies, Domingos and Richardson posed a fundamental algorithmic problem for such social network processes: if we can try to convince a subset of individuals to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target? We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63 % of optimal for several classes of models; our framework suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks. We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform nodeselection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.

Citations

863 Integer and combinatorial optimization - Wolsey, Nemhauser - 1999
548 Interacting Particle Systems - Liggett - 1985
425 Implementing data cubes efficiently - Harinarayan, Rajaraman, et al. - 1996
376 Faust K: Social Network Analysis - Wasserman - 1994
342 Error and attack tolerance of complex networks. Nature 406: 378–382 Bliss TV, Collingridge GL - Albert, Jeong, et al. - 2000
299 The structure of scientific collaboration networks - Newman - 2001
252 An analysis of the approximations for maximizing submodular set functions - Nemhauser, Wosley, et al. - 1978
229 A new product growth model for consumer durables - Bass - 1969
217 Mining the network value of customers - Domingos, Richardson
178 Threshold models of collective behavior - Granovetter - 1978
156 Individual Strategy and Social Structure:An Evolutionary Theory of Institutions. Princeton NJ - Young - 1998
138 Mining knowledge-sharing sites for viral marketing - Richardson, Domingos - 2002
134 Diffusion of innovations. The Free - Rogers
127 The statistical mechanics of strategic interaction - Blume - 1993
120 New product diffusion models in marketing: A review and directions for research - Mahajan, Muller, et al. - 1990
108 Network Models of the Diffusion of Innovations - Valente - 1995
88 A simple model of global cascades on random networks - Watts - 2002
75 Talk of the Network: A Complex Systems Look at the Underlying - Goldenberg, Libai, et al. - 2001
65 Social ties and word-of-mouth referral behavior - Brown, Reingen - 1987
57 R (2002) From Factors to Actors: Computational Sociology and Agent-Based Modeling. Annual review of sociology. pp 143–167 - Macy, Willer
54 Lecture Notes on Particle Systems and Percolation - Durrett - 1988
28 The influence model: a tractable representation for the dynamics of networked Markov chains - Asavathiratham - 2001
28 Local majority voting, small coalitions and controlling monopolies in graphs: A review - Peleg - 1996
28 Structure and strategy in collective action - Chwe - 1999
21 Chains of Cooperation: Threshold Effects in Collective Action - Macy - 1991
16 Location of bank accounts to optimize float - Cornuejols, Fisher, et al. - 1977
15 Dynamic monopolies of constant size - Berger
15 Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review, 2001. [Gra78] M. Granovetter. Threshold models of colle - Goldenberg, Libai, et al. - 1978
9 The influence model - Asavathiratham, Roy, et al. - 2005
3 The diffusion of innovations in social networks. Santa Fe Institute Working Paper 02-04-018 - Young
1 Medical Innovations: A Diffusion Study Bobbs - Coleman, Menzel, et al. - 1966
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University