CoChat

Competing for Attention in Social Media under Information Overload Conditions

Open access
Feng, Ling, Hu, Yanqing, Li, Baowen, Stanley, H. Eugene, Havlin, Shlomo, Braunstein, Lidia A. · 2015 · PLOS ONE

The DOI matches its Crossref record; 55 of the 56 references it cites were found in a registry or an index.

Abstract

Modern social media are becoming overloaded with information because of the rapidly-expanding number of information feeds. We analyze the user-generated content in Sina Weibo, and find evidence that the spread of popular messages often follow a mechanism that differs from the spread of disease, in contrast to common belief. In this mechanism, an individual with more friends needs more repeated exposures to spread further the information. Moreover, our data suggest that for certain messages the chance of an individual to share the message is proportional to the fraction of its neighbours who shared it with him/her, which is a result of competition for attention. We model this process using a fractional susceptible infected recovered (FSIR) model, where the infection probability of a node is proportional to its fraction of infected neighbors. Our findings have dramatic implications for information contagion. For example, using the FSIR model we find that real-world social networks have a finite epidemic threshold in contrast to the zero threshold in disease epidemic models. This means that when individuals are overloaded with excess information feeds, the information either reaches out the population if it is above the critical epidemic threshold, or it would never be well received.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0126090

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig 1 Graphical representation of a diffusion tree on Sina Weibo. This is a graphic representation for one of the popular messages on Weibo, and the branching process can be seen. It has been shared more than 190,000 times. The purple dots represent users who have shared the message, and green lines represent the paths through which the messages are spread. If a user A shared the message from user B, a green line is drawn between both. The clusters of purple dots corresponds to a user with a large number of followers who have shared the message from this user.
Fig 1 Graphical representation of a diffusion tree on Sina Weibo. This is a graphic representation for one of the popular messages on Weibo, and the branching process can be seen. It has been shared more than 190,000 times. The purple dots represent users who have shared the message, and green lines represent the paths through which the messages are spread. If a user A shared the message from user B, a green line is drawn between both. The clusters of purple dots corresponds to a user with a large number of followers who have shared the message from this user.CC BY · PubMed Central
Fig 2 Plot of ⟨k_⟩ for each of the the most popular messages as a function of N i. Messages are the most popular ones from Sina Weibo in December 2012. Majority of the most popular messages have average preceding sharing neighbors smaller than 2, which contradicts the SIR model. This hints that the mechanism might be different from SIR models for disease spreading for scale-free network of OSN type.
Fig 2 Plot of ⟨k_⟩ for each of the the most popular messages as a function of N i. Messages are the most popular ones from Sina Weibo in December 2012. Majority of the most popular messages have average preceding sharing neighbors smaller than 2, which contradicts the SIR model. This hints that the mechanism might be different from SIR models for disease spreading for scale-free network of OSN type.CC BY · PubMed Central
Fig 3 Comparison between empirical data and simulation results of FSIR and SIR models. In the simulation, the total number of nodes is N = 100,000. The degree distribution is chosen at P(k) ∼ k −2.5, k min = 20 and ⟨k⟩ ≈ 50. With these parameters this distribution is close to the empirical distribution of OSNs. The chosen parameter Γ = 0.7 for FSIR and 0.15 for SIR is such that the fraction of infected nodes R = N i/N ≈ 0.5%, is close to the empirical R values of the most popular messages. As we can see, for empirical and FSIR, ⟨k_⟩ values does not change significantly with N i as seen in A and D. However, as seen in G, SIR shows a clear increase of ⟨k_⟩ as a function of N i. As seen in D and F, most of the real messages and FSIR result have ⟨k_⟩ < 2, meaning they are small outbreaks below epidemic threshold. But in I, we see that for SIR simulations, ⟨k_⟩ > 2. This means the messages are epidemics spreading rather than small outbreaks. In B and E, we show that both real data and FSIR have similar distributions of N i values, with number of messages decreases significantly with increasing popularity N i. This is in contrast to SIR result in H. Hence through simulations, we show that FSIR captures the statistics of real data from popular messages, yet SIR does not.
Fig 3 Comparison between empirical data and simulation results of FSIR and SIR models. In the simulation, the total number of nodes is N = 100,000. The degree distribution is chosen at P(k) ∼ k −2.5, k min = 20 and ⟨k⟩ ≈ 50. With these parameters this distribution is close to the empirical distribution of OSNs. The chosen parameter Γ = 0.7 for FSIR and 0.15 for SIR is such that the fraction of infected nodes R = N i/N ≈ 0.5%, is close to the empirical R values of the most popular messages. As we can see, for empirical and FSIR, ⟨k_⟩ values does not change significantly with N i as seen in A and D. However, as seen in G, SIR shows a clear increase of ⟨k_⟩ as a function of N i. As seen in D and F, most of the real messages and FSIR result have ⟨k_⟩ < 2, meaning they are small outbreaks below epidemic threshold. But in I, we see that for SIR simulations, ⟨k_⟩ > 2. This means the messages are epidemics spreading rather than small outbreaks. In B and E, we show that both real data and FSIR have similar distributions of N i values, with number of messages decreases significantly with increasing popularity N i. This is in contrast to SIR result in H. Hence through simulations, we show that FSIR captures the statistics of real data from popular messages, yet SIR does not.CC BY · PubMed Central
Fig 4 R as a function of Γ for τ = 2 with N = 105 on SF networks with λ = 2.5 (black) and λ = 3 (red) and k min = 20. As shown in the plots FSIR has a critical point around Γc ≈ 1, independent of the degree distribution. The same critical value Γc is observed for other degree distributions with different parameter settings.
Fig 4 R as a function of Γ for τ = 2 with N = 105 on SF networks with λ = 2.5 (black) and λ = 3 (red) and k min = 20. As shown in the plots FSIR has a critical point around Γc ≈ 1, independent of the degree distribution. The same critical value Γc is observed for other degree distributions with different parameter settings.CC BY · PubMed Central
Fig 5 Plot of R as a function of Γ for different types of random networks. Regardless of the types of networks, the critical threshold for phase transition Γc is always larger than 1.0. For networks with larger ⟨k⟩ values, Γc is closer to 1.0 as predicted by Eq (4).
Fig 5 Plot of R as a function of Γ for different types of random networks. Regardless of the types of networks, the critical threshold for phase transition Γc is always larger than 1.0. For networks with larger ⟨k⟩ values, Γc is closer to 1.0 as predicted by Eq (4).CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 55 references

Cited by

See all 133

Metadata

Authors
Feng, L., Hu, Y., Li, B., Stanley, H. E., Havlin, S., & Braunstein, L. A.
Affiliations
  • Agency for Science, Technology and Research (SG)
  • Sun Yat-sen University (CN)
  • Tongji University (CN)
  • Bar-Ilan University (IL)
  • Consejo Nacional de Investigaciones Científicas y Técnicas (AR)
Corresponding author
Feng, Ling
Venue
PLOS ONE
Published
2015-07-10
Volume
10
Issue
7
Pages
e0126090
ISSN
1932-6203 (ISSN-L)
OpenAlex
W1777927488
Cited by
133
References
56
Citations by year
2026: 11 · 2025: 22 · 2024: 8 · 2023: 12 · 2022: 8 · 2021: 17 · 2020: 17 · 2019: 6 · 2018: 8 · 2017: 9 · 2016: 11 · 2015: 3
FWCI
6.50
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • OpenBU (Boston University) (submittedVersion, cc-by)
  • arXiv (Cornell University)
  • Greater South Information System
Funders
  • National Science Foundation (HDTRA1-14-1-0017, 1125290)
  • Israel Science Foundation
  • Defense Threat Reduction Agency (HDTRA-1-14-1-0017, CMMI 1125290, HDTRA1)
  • Fundamental Research Funds for the Central Universities
  • Office of Naval Research (N00014-14-1-0738, CMMI 1125290, N00014)
  • Division of Civil, Mechanical and Manufacturing Innovation (1125290, CMMI-1125290)
  • Fondo para la Investigación Científica y Tecnológica
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
  • Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
Keywords
information overload, social media, information contagion, competition for attention, user-generated content, Weibo, epidemic threshold, message sharing
MeSH terms
Attention, Competitive Behavior, Humans, Models, Psychological, Probability, Social Behavior, Internet, Friends, Information Dissemination, Social Networking

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Competing for Attention in Social Media under Information Overload Conditions. https://app.cochat.ai/papers/10.1371/journal.pone.0126090
The paper
Feng, L., Hu, Y., Li, B., Stanley, H. E., Havlin, S., & Braunstein, L. A. (2015). Competing for Attention in Social Media under Information Overload Conditions. PLOS ONE. https://doi.org/10.1371/journal.pone.0126090

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.