Maximizing the spread of influence through a social network
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
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 node-selection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rogers, E. M., Singhal, A., & Quinlan, M. M. (2019) · An Integrated Approach to Communication Theory and Research · doi:10.4324/9780203710753-35 · Cited by 37,322
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Threshold models of collective behavior
Granovetter, M. (1978) · American Journal of Sociology · doi:10.1086/226707 · Cited by 6,072
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
A new product growth for model consumer durables
Bass, F. M. (1969) · Management Science · doi:10.1287/mnsc.15.5.215 · Cited by 6,008
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Cited by
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Cost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007) · ACM Transactions on the Web · doi:10.1145/1232722.1232727 · Cited by 2,032
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Self-citationTwitterRank: finding topic-sensitive influential twitterers
Weng, J., Lim, E.-P., Jiang, J., & He, Q. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718520 · Cited by 1,742
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Chen, W., Wang, C., & Wang, Y. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835934 · Cited by 1,731
Everyone's an influencer: quantifying influence on twitter
Bakshy, E., Hofman, J. M., Mason, W. A., & Watts, D. J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935845 · Cited by 1,689
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Job Information Networks, Neighborhood Effects, and Inequality
Ioannides, Y. M., & Loury, L. D. (2004) · Journal of Economic Literature · doi:10.1257/0022051043004595 · Cited by 1,113
Identifying influential and susceptible members of social networks
Aral, S., & Walker, D. (2012) · Science · doi:10.1126/science.1215842 · Cited by 1,047
Information diffusion through blogspace
Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988739 · Cited by 1,041
Learning influence probabilities in social networks
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718518 · Cited by 1,022
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
Influential Nodes in a Diffusion Model for Social Networks
Kempe, D., Kleinberg, J., & Tardos, É. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_91 · Cited by 948
Self-citationInformation diffusion through blogspace
Gruhl, D., Liben-Nowell, D., Guha, R., & Tomkins, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046462 · Cited by 927
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
Chen, W., Yuan, Y., & Zhang, L. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.118 · Cited by 924
Information diffusion in online social networks: a survey
Guille, A., Hacid, H., Favre, C., & Zighed, D. A. (2013) · ACM SIGMOD Record · doi:10.1145/2503792.2503797 · Cited by 851
Limiting the spread of misinformation in social networks
Budak, C., Agrawal, D., & El Abbadi, A. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963499 · Cited by 807
A measurement-driven analysis of information propagation in the flickr social network
Cha, M., Mislove, A., & Gummadi, K. P. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526806 · Cited by 768
Influence Maximization in Near-Linear Time: A Martingale Approach
Tang, Y., Shi, Y., & Xiao, X. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2723734 · Cited by 768
Submodular Function Maximization
Krause, A., & Golovin, D. (2014) · Tractability · doi:10.1017/cbo9781139177801.004 · Cited by 751
An empirical study of the factors affecting social network service use
Kwon, O., & Wen, Y. (2010) · Computers in Human Behavior · doi:10.1016/j.chb.2009.04.011 · Cited by 722
Inferring networks of diffusion and influence
Gomez Rodriguez, M., Leskovec, J., & Krause, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835933 · Cited by 679
Influence and correlation in social networks
Anagnostopoulos, A., Kumar, R., & Mahdian, M. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401897 · Cited by 674
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
The “majority illusion” in social networks
Lerman, K., Yan, X., & Wu, X.-Z. (2016) · PLOS ONE · doi:10.1371/journal.pone.0147617 · Cited by 669
Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
(2016) · IEEE Control Systems · doi:10.1109/mcs.2015.2495000 · Cited by 663
Influence Maximization on Social Graphs: A Survey
Li, Y., Fan, J., Wang, Y., & Tan, K.-L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807843 · Cited by 659
The Diversity-Bandwidth Trade-off
Aral, S., & Van Alstyne, M. (2011) · American Journal of Sociology · doi:10.1086/661238 · Cited by 654
The Structural Virality of Online Diffusion
Goel, S., Anderson, A., Hofman, J., & Watts, D. J. (2016) · Management Science · doi:10.1287/mnsc.2015.2158 · Cited by 647
Time-varying graphs and dynamic networks
Casteigts, A., Flocchini, P., Quattrociocchi, W., & Santoro, N. (2012) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760.2012.668546 · Cited by 592
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
A Neural Influence Diffusion Model for Social Recommendation
Wu, L., Sun, P., Fu, Y., Hong, R., Wang, X., & Wang, M. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331214 · Cited by 589
Patterns of Cascading Behavior in Large Blog Graphs
Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N., & Hurst, M. (2007) · Proceedings of the 2007 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.60 · Cited by 570
DeepInf: Social Influence Prediction with Deep Learning
Qiu, J., Tang, J., Ma, H., Dong, Y., Wang, K., & Tang, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220077 · Cited by 587
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Wang, Y., Cong, G., Song, G., & Xie, K. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835935 · Cited by 541
Mining Point Cloud Local Structures by Kernel Correlation and Graph Pooling
Shen, Y., Feng, C., Yang, Y., & Tian, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00478 · Cited by 532
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
Combating Fake News: A Survey on Identification and Mitigation Techniques
Sharma, K., Qian, F., Jiang, H., Ruchansky, N., Zhang, M., & Liu, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3305260 · Cited by 514
“The diffusion process is modeled using the Independent Cascade or Linear Threshold model [47] described earlier.”
MethodSIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
Goyal, A., Lu, W., & Lakshmanan, L. V. S. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.132 · Cited by 508
Mobile Data Offloading through Opportunistic Communications and Social Participation
Han, B., Hui, P., Kumar, V. S. A., Marathe, M. V., Shao, J., & Srinivasan, A. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2011.101 · Cited by 489
Dynamics of information diffusion and its applications on complex networks
Zhang, Z.-K., Liu, C., Zhan, X.-X., Lu, X., Zhang, C.-X., & Zhang, Y.-C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.07.002 · Cited by 484
On Submodularity and Controllability in Complex Dynamical Networks
Summers, T. H., Cortesi, F. L., & Lygeros, J. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2453711 · Cited by 482
Information diffusion and external influence in networks
Myers, S. A., Zhu, C., & Leskovec, J. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339540 · Cited by 475
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
Golovin, D., & Krause, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.3967 · Cited by 461
Inferring Networks of Diffusion and Influence
Gomez-Rodriguez, M., Leskovec, J., & Krause, A. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2086737.2086741 · Cited by 445
Tractable Models for Information Diffusion in Social Networks
Kimura, M., & Saito, K. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871637_27 · Cited by 444
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
Self-citationPrediction of Information Diffusion Probabilities for Independent Cascade Model
Saito, K., Nakano, R., & Kimura, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85567-5_9 · Cited by 436
Measuring user influence on Twitter: A survey
Riquelme, F., & González-Cantergiani, P. (2016) · Information Processing & Management · doi:10.1016/j.ipm.2016.04.003 · Cited by 429
A data-based approach to social influence maximization
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2047485.2047492 · Cited by 428
Finding key players in complex networks through deep reinforcement learning
Fan, C., Zeng, L., Sun, Y., & Liu, Y.-Y. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0177-2 · Cited by 425
What's in a hashtag?: content based prediction of the spread of ideas in microblogging communities
Tsur, O., & Rappoport, A. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124320 · Cited by 423
Tracing information flow on a global scale using Internet chain-letter data
Liben-Nowell, D., & Kleinberg, J. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708471105 · Cited by 422
Self-citationTracking Information Epidemics in Blogspace
Adar, E., & Adamic, L. A. (2005) · The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) · doi:10.1109/wi.2005.151 · Cited by 408
Optimal Pricing in Networks with Externalities
Candogan, O., Bimpikis, K., & Ozdaglar, A. (2012) · Operations Research · doi:10.1287/opre.1120.1066 · Cited by 405
Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model
He, X., Song, G., Chen, W., & Jiang, Q. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.40 · Cited by 403
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Akiba, T., Iwata, Y., & Yoshida, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2465315 · Cited by 400
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2006) · Proceedings of the 7th ACM conference on Electronic commerce · doi:10.1145/1134707.1134732 · Cited by 391
The structure of online diffusion networks
Goel, S., Watts, D. J., & Goldstein, D. G. (2012) · Proceedings of the 13th ACM Conference on Electronic Commerce · doi:10.1145/2229012.2229058 · Cited by 385
Big Data and supply chain management: A review and bibliometric analysis
Mishra, D., Gunasekaran, A., Papadopoulos, T., & Childe, S. J. (2018) · Annals of Operations Research · doi:10.1007/s10479-016-2236-y · Cited by 382
A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
Narayanam, R., & Narahari, Y. (2011) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2010.2052042 · Cited by 382
A Time-Dependent SIR Model for COVID-19 With Undetectable Infected Persons
Chen, Y.-C., Lu, P.-E., Chang, C.-S., & Liu, T.-H. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3024723 · Cited by 370
Muller, E., & Peres, R. (2019) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2018.05.003 · Cited by 367
Optimal marketing strategies over social networks
Hartline, J., Mirrokni, V., & Sundararajan, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367524 · Cited by 364
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Zheng, Z., & Makse, H. A. (2014) · Scientific Reports · doi:10.1038/srep05547 · Cited by 362
Uncovering the Temporal Dynamics of Diffusion Networks
Gomez-Rodriguez, M., Balduzzi, D., & Schölkopf, B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.0697 · Cited by 360
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · Cited by 359
Impact of social influence in e-commerce decision making
Kim, Y. A., & Srivastava, J. (2007) · Proceedings of the ninth international conference on Electronic commerce · doi:10.1145/1282100.1282157 · Cited by 358
Fast discovery of connection subgraphs
Faloutsos, C., McCurley, K. S., & Tomkins, A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014068 · Cited by 355
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate
Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., & Yuan, Y. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.33 · Cited by 352
Community Detection and Mining in Social Media
Tang, L., & Liu, H. (2010) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00298ed1v01y201009dmk003 · Cited by 352
Identifying topical authorities in microblogs
Pal, A., & Counts, S. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935843 · Cited by 349
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
Nguyen, H. T., Thai, M. T., & Dinh, T. N. (2016) · Proceedings of the 2016 International Conference on Management of Data · doi:10.1145/2882903.2915207 · Cited by 346
Staab, S., Domingos, P., Mika, P., Golbeck, J., Ding, L., Finin, T., Joshi, A., Nowak, A., & Vallacher, R. R. (2005) · IEEE Intelligent Systems · doi:10.1109/mis.2005.16 · Cited by 346
The convergence of social and technological networks
Kleinberg, J. (2008) · Communications of the ACM · doi:10.1145/1400214.1400232 · Cited by 346
Self-citationKhosla, A., Das Sarma, A., & Hamid, R. (2014) · Proceedings of the 23rd international conference on World wide web · doi:10.1145/2566486.2567996 · Cited by 343
A Survey of Signed Network Mining in Social Media
Tang, J., Chang, Y., Aggarwal, C., & Liu, H. (2017) · ACM Computing Surveys · doi:10.1145/2956185 · Cited by 342
Social ties and their relevance to churn in mobile telecom networks
Dasgupta, K., Singh, R., Viswanathan, B., Chakraborty, D., Mukherjea, S., Nanavati, A. A., & Joshi, A. (2008) · Proceedings of the 11th international conference on Extending database technology: Advances in database technology · doi:10.1145/1353343.1353424 · Cited by 326
Binary Opinion Dynamics with Stubborn Agents
Yildiz, E., Ozdaglar, A., Acemoglu, D., Saberi, A., & Scaglione, A. (2013) · ACM Transactions on Economics and Computation · doi:10.1145/2538508 · Cited by 321
Identifying a set of influential spreaders in complex networks
Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 320
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Viral effects of social network and media on consumers’ purchase intention
Gunawan, D. D., & Huarng, K.-H. (2015) · Journal of Business Research · doi:10.1016/j.jbusres.2015.06.004 · Cited by 312
Social influence and the diffusion of user-created content
Bakshy, E., Karrer, B., & Adamic, L. A. (2009) · Proceedings of the 10th ACM conference on Electronic commerce · doi:10.1145/1566374.1566421 · Cited by 308
Patterns of Influence in a Recommendation Network
Leskovec, J., Singh, A., & Kleinberg, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_44 · Cited by 307
Self-citationRise and fall patterns of information diffusion: model and implications
Matsubara, Y., Sakurai, Y., Prakash, B. A., Li, L., & Faloutsos, C. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339537 · Cited by 306
Threshold Models for Competitive Influence in Social Networks
Borodin, A., Filmus, Y., & Oren, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17572-5_48 · Cited by 306
An Introduction to Social Network Data Analytics
Aggarwal, C. C. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_1 · Cited by 306
Braunstein, A., Dall’Asta, L., Semerjian, G., & Zdeborová, L. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1605083113 · Cited by 301
Streaming submodular maximization: massive data summarization on the fly
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., & Krause, A. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623637 · Cited by 300
Modeling and Predicting Popularity Dynamics via Reinforced Poisson Processes
Shen, H., Wang, D., Song, C., & Barabási, A.-L. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8739 · Cited by 297
Using a model of social dynamics to predict popularity of news
Lerman, K., & Hogg, T. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772754 · Cited by 295
Yes, there is a correlation: - from social networks to personal behavior on the web
Singla, P., & Richardson, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367586 · Cited by 294
Tracing Fake-News Footprints: Characterizing Social Media Messages by How They Propagate
Wu, L., & Liu, H. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159677 · Cited by 292
Metadata
- Authors
- Kempe, D., Kleinberg, J., & Tardos, É.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 137-146
- OpenAlex
- W2061820396
- Cited by
- 7,326
- References
- 38
- FWCI
- 40.61
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.