The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Influential Nodes in a Diffusion Model for 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
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Self-citationThreshold 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
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
Micromotives and Macrobehavior
Eaton, B. C., & Schelling, T. C. (1981) · The Canadian Journal of Economics · doi:10.2307/134812 · Cited by 3,758
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Social Ties and Word-of-Mouth Referral Behavior
Brown, J. J., & Reingen, P. H. (1987) · Journal of Consumer Research · doi:10.1086/209118 · Cited by 2,378
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
Goldenberg, J., Libai, B., & Muller, E. (2001) · Marketing Letters · doi:10.1023/a:1011122126881 · Cited by 1,995
Cited by
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
TwitterRank: 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
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
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
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
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
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
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
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
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
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
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
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
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
The Critical Node Detection Problem in networks: A survey
Lalou, M., Tahraoui, M. A., & Kheddouci, H. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.02.002 · Cited by 311
Li, F., & Du, T. C. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.12.007 · Cited by 301
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Asur, S., Parthasarathy, S., & Ucar, D. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1631162.1631164 · Cited by 291
Simulated Annealing Based Influence Maximization in Social Networks
Jiang, Q., Song, G., Gao, C., Wang, Y., Si, W., & Xie, K. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7838 · Cited by 288
Decomposing the Value of Word-of-Mouth Seeding Programs: Acceleration versus Expansion
Libai, B., Muller, E., & Peres, R. (2013) · Journal of Marketing Research · doi:10.1509/jmr.11.0305 · Cited by 280
Cascading Behavior in Networks: Algorithmic and Economic Issues
Kleinberg, J. (2007) · Algorithmic Game Theory · doi:10.1017/cbo9780511800481.026 · Cited by 279
Self-citationUsing Gossips to Spread Information: Theory and Evidence from Two Randomized Controlled Trials
Banerjee, A., Chandrasekhar, A. G., Duflo, E., & Jackson, M. O. (2019) · The Review of Economic Studies · doi:10.1093/restud/rdz008 · Cited by 272
A survey on influence maximization in a social network
Banerjee, S., Jenamani, M., & Pratihar, D. K. (2020) · Knowledge and Information Systems · doi:10.1007/s10115-020-01461-4 · Cited by 262
Spreading Processes in Multilayer Networks
Salehi, M., Sharma, R., Marzolla, M., Magnani, M., Siyari, P., & Montesi, D. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2425961 · Cited by 255
Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey
Kayastha, N., Niyato, D., Wang, P., & Hossain, E. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2169033 · Cited by 253
Spreading dynamics in complex networks
Pei, S., & Makse, H. A. (2013) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2013/12/p12002 · Cited by 252
Gossip: Identifying Central Individuals in a Social Network
Banerjee, A., Chandrasekhar, A., Duflo, E., & Jackson, M. (2014) · doi:10.3386/w20422 · Cited by 143
Efficient computation of the shapley value for centrality in networks
Aadithya, K. V., Ravindran, B., Michalak, T. P., & Jennings, N. R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17572-5_1 · Cited by 59
Xu, J., & Bi, Y. (2024) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4064623 · Cited by 7
Metadata
- Authors
- Kempe, D., Kleinberg, J., & Tardos, É.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 1127-1138
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1654194294
- Cited by
- 948
- References
- 21
- FWCI
- 19.93
- 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.