The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Why rumors spread so quickly in social networks
Abstract
A few hubs with many connections share with many individuals with few connections.
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
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 · cited 4×
“For these graphs, the authors of [3] empirically discovered a power-law of k, which was later proven mathematically by Bollobás, Riordan, Spencer, and Tusnády [11].”
BackgroundMethodInfluentialDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“Several experimental studies [1, 13, 22] revealed another intrinsic property of social networks: the histogram of the node connectivity follows a power-law; the number of nodes with k neighbors is inversely proportional to a polynomial in k.”
BackgroundBoyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G. (2001) · Random Structures & Algorithms · doi:10.1002/rsa.1009 · Cited by 804
Linked: How Everything Is Connected to Everything Else and What It Means
Barabási, A.-Ĺ. (2003) · Plume eBooks · Cited by 734
Karp, R., Schindelhauer, C., Shenker, S., & Vocking, B. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892324 · Cited by 718
The Diameter of a Scale-Free Random Graph
Bollob�s*, B., & Riordan, O. (2004) · Combinatorica · doi:10.1007/s00493-004-0002-2 · Cited by 594
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Houser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., & Terry, D. (1988) · ACM SIGOPS Operating Systems Review · doi:10.1145/43921.43922 · Cited by 312
Robustness and Vulnerability of Scale-Free Random Graphs
Bollobás, B., & Riordan, O. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129080 · Cited by 273
Extracting Large-Scale Knowledge Bases from the Web
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Cited by 239
On the spread of viruses on the internet
Berger, N., Borgs, C., Chayes, J., & Saberi, A. (2005) · doi:10.5555/1070432.1070475 · Cited by 183
On certain connectivity properties of the internet topology
Mihail, M., Papadimitriou, C. H., & Saberi, A. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.06.009 · Cited by 142
Coupling Scale-Free and Classical Random Graphs
Bollobás, B., & Riordan, O. M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129084 · Cited by 61
Cited by
The spread of true and false news online
Vosoughi, S., Roy, D., & Aral, S. (2018) · Science · doi:10.1126/science.aap9559 · Cited by 8,847
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
False Information on Web and Social Media: A Survey
Kumar, S., & Shah, N. (2018) · arXiv · doi:10.48550/arxiv.1804.08559 · Cited by 289
“[23] on realistic spread of simple rumors, on several graphs having the structure of existing large social networks, showed that even a rumor started by a random node on average reaches 45.”
BackgroundCost-Efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks
He, Z., Cai, Z., Yu, J., Wang, X., Sun, Y., & Li, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2585591 · Cited by 277
Challenges in the Decentralised Web: The Mastodon Case
Raman, A., Joglekar, S., Cristofaro, E. D., Sastry, N., & Tyson, G. (2019) · Proceedings of the Internet Measurement Conference · doi:10.1145/3355369.3355572 · Cited by 118
Metadata
- Authors
- Doerr, B., Fouz, M., & Friedrich, T.
- Venue
- Communications of the ACM
- Published
- 2012-06
- Volume
- 55
- Issue
- 6
- Pages
- 70-75
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1980868027
- Cited by
- 357
- References
- 15
- FWCI
- 20.92
- 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.