The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Rumors in a Network: Who's the Culprit?
Abstract
We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with the popular susceptible-infected (SI) model and then construct an estimator for the rumor source. This estimator is based upon a novel topological quantity which we term rumor centrality. We establish that this is a maximum likelihood (ML) estimator for a class of graphs. We find the following surprising threshold phenomenon: on trees which grow faster than a line, the estimator always has nontrivial detection probability, whereas on trees that grow like a line, the detection probability will go to 0 as the network grows. Simulations performed on synthetic networks such as the popular small-world and scale-free networks, and on real networks such as an internet AS network and the U.S. electric power grid network, show that the estimator either finds the source exactly or within a few hops of the true source across different network topologies. We compare rumor centrality to another common network centrality notion known as distance centrality. We prove that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ. Indeed, simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Robust Action and the Rise of the Medici, 1400-1434
Padgett, J. F., & Ansell, C. K. (1993) · American Journal of Sociology · doi:10.1086/230190 · Cited by 2,276
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Epidemics and percolation in small-world networks
Moore, C., & Newman, M. E. J. (2000) · Physical Review E · doi:10.1103/physreve.61.5678 · Cited by 948
The effect of network topology on the spread of epidemics
Ganesh, A., Massoulie, L., & Towsley, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498374 · Cited by 734
The Mathematical Theory of Infectious Diseases and Its Applications
Giles, P. (1977) · Journal of the Operational Research Society · doi:10.1057/jors.1977.92 · Cited by 421
Generating random spanning trees
Broder, A. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63516 · Cited by 349
Broadcasting on trees and the Ising model
Evans, W., Kenyon, C., Peres, Y., & Schulman, L. J. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487349 · Cited by 270
First-Passage Percolation on the Square Lattice
Smythe, R. T., & Wierman, J. C. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0063306 · Cited by 211
Some Limit Theorems for Percolation Processes with Necessary and Sufficient Conditions
Cox, J. T., & Durrett, R. (1981) · The Annals of Probability · doi:10.1214/aop/1176994364 · Cited by 206
EPIDEMIC SPREADING IN SCALEFREE NETWORKS
Pastor‐Satorras, R., & Vespignani, A. (2001) · Cited by 169
Counting linear extensions is #P-complete
Brightwell, G., & Winkler, P. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103441 · Cited by 163
O’Neill, P. D. (2002) · Mathematical Biosciences · doi:10.1016/s0025-5564(02)00109-8 · Cited by 159
Percolation Theory and First-Passage Percolation
Kesten, H. (1987) · The Annals of Probability · doi:10.1214/aop/1176991975 · Cited by 109
Cited by
False rumors detection on Sina Weibo by propagation structures
Wu, K., Yang, S., & Zhu, K. Q. (2015) · 2015 IEEE 31st International Conference on Data Engineering · doi:10.1109/icde.2015.7113322 · Cited by 585
Meel, P., & Vishwakarma, D. K. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112986 · Cited by 505
Online misinformation about climate change
Treen, K. M. D., Williams, H. T. P., & O'Neill, S. J. (2020) · WIREs Climate Change · doi:10.1002/wcc.665 · Cited by 441
Epidemiological 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
Inferring the origin of an epidemic with a dynamic message-passing algorithm
Lokhov, A. Y., Mézard, M., Ohta, H., & Zdeborová, L. (2014) · Physical Review E · doi:10.1103/physreve.90.012801 · Cited by 322
Metadata
- Authors
- Shah, D., & Zaman, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-08
- Volume
- 57
- Issue
- 8
- Pages
- 5163-5181
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2111772797
- Cited by
- 691
- References
- 19
- FWCI
- 20.91
- Type
- journal article
- 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.