The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
Inferring networks of diffusion and influence
Abstract
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observing individual transmissions (i.e., who infects whom or who influences whom) is typically very difficult. Furthermore, in many applications, the underlying network over which the diffusions and propagations spread is actually unobserved. We tackle these challenges by developing a method for tracing paths of diffusion and influence through networks and inferring the networks over which contagions propagate. Given the times when nodes adopt pieces of information or become infected, we identify the optimal network that best explains the observed infection times. Since the optimization problem is NP-hard to solve exactly, we develop an efficient approximation algorithm that scales to large datasets and in practice gives provably near-optimal performance. We demonstrate the effectiveness of our approach by tracing information cascades in a set of 170 million blogs and news articles over a one year period to infer how information flows through the online media space. We find that the diffusion network of news tends to have a core-periphery structure with a small set of core media sites that diffuse information to the rest of the Web. These sites tend to have stable circles of influence with more general news media sites acting as connectors between them.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Infectious Diseases of Humans: Dynamics and Control
(1992) · Annals of Internal Medicine · doi:10.7326/0003-4819-117-2-174_4 · Cited by 7,746
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
The Mathematics of Infectious Diseases
Hethcote, H. W. (2000) · SIAM Review · doi:10.1137/s0036144500371907 · Cited by 6,687
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
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
Respondent-Driven Sampling: A New Approach to the Study of Hidden Populations
Heckathorn, D. D. (1997) · Social Problems · doi:10.1525/sp.1997.44.2.03x0221m · Cited by 4,409
Cited by
The role of social networks in information diffusion
Bakshy, E., Rosenn, I., Marlow, C., & Adamic, L. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187907 · Cited by 1,526
Supervised random walks: predicting and recommending links in social networks
Backstrom, L., & Leskovec, J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935914 · Cited by 982
Self-citationWho says what to whom on twitter
Wu, S., Hofman, J. M., Mason, W. A., & Watts, D. J. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963504 · Cited by 957
SNAP: A General-Purpose Network Analysis and Graph-Mining Library
Leskovec, J., & Sosič, R. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2898361 · Cited by 870
Self-citationSocial big data: recent achievements and new challenges
Bello-Orgaz, G., Jung, J. J., & Camacho, D. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.08.005 · Cited by 846
“The NETINT method [78] has applied sub-modular, function-based iterative optimisation to discover the spreading cascade (path) that maximises the likelihood of the collected dataset.”
MethodInformation 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
Detecting and Tracking Political Abuse in Social Media
Ratkiewicz, J., Conover, M., Meiss, M., Goncalves, B., Flammini, A., & Menczer, F. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14127 · Cited by 579
Ratkiewicz (2011) · doi:10.1145/1963192.1963301 · 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
The Matthew effect in empirical data
Perc, M. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0378 · Cited by 456
Learning Graphs From Data: A Signal Representation Perspective
Dong, X., Thanou, D., Rabbat, M., & Frossard, P. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2887284 · Cited by 406
The Consequences of the Internet for Politics
Farrell, H. (2012) · Annual Review of Political Science · doi:10.1146/annurev-polisci-030810-110815 · Cited by 387
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
Self-citationEpidemiological modeling of news and rumors on Twitter
Jin, F., Dougherty, E., Saraf, P., Cao, Y., & Ramakrishnan, N. (2013) · Proceedings of the 7th Workshop on Social Network Mining and Analysis · doi:10.1145/2501025.2501027 · Cited by 342
Exercise contagion in a global social network
Aral, S., & Nicolaides, C. (2017) · Nature Communications · doi:10.1038/ncomms14753 · Cited by 329
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
The current state of fake news: challenges and opportunities
Figueira, Á., & Oliveira, L. (2017) · Procedia Computer Science · doi:10.1016/j.procs.2017.11.106 · Cited by 293
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
Structure and dynamics of information pathways in online media
Gomez Rodriguez, M., Leskovec, J., & Schölkopf, B. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433402 · Cited by 271
Self-citationSocial influence modeling using information theory in mobile social networks
Peng, S., Yang, A., Cao, L., Yu, S., & Xie, D. (2017) · Information Sciences · doi:10.1016/j.ins.2016.08.023 · Cited by 200
Metadata
- Authors
- Gomez Rodriguez, M., Leskovec, J., & Krause, A.
- Venue
- Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2010-07-25
- Pages
- 1019-1028
- OpenAlex
- W1996816151
- Cited by
- 679
- References
- 67
- FWCI
- 39.64
- 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.