Skip to main content

Rumor Spreading Model Considering Rumor’s Attraction in Heterogeneous Social Networks

  • Conference paper
  • First Online:
Cloud Computing and Security (ICCCS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11067))

Included in the following conference series:

  • 2288 Accesses

Abstract

In this paper, we propose a modified susceptible-infected-removed (SIR) model with introduction of rumor’s attraction and establish corresponding mean-field equations to characterize the dynamics of SIR model on heterogeneous social networks. Then a steady-state analysis is conducted to investigate how the rumor’s attraction influences the threshold behavior and the final rumor size. Theoretical analysis and simulation results demonstrate that the rumor spreading threshold is related to the topological characteristics of underlying network and the infectivity of individual but is independent of the attraction of the rumor itself. In addition, whether a rumor spreads or not is determined by the relationship between the effective spreading rate and the spreading threshold. We also find that when a rumor’s attraction is very high, the effective spreading rate can easily reach the critical rumor spreading threshold, which leads to rumor spreading far and wide.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Pei, S., Muchnik, L., Tang, S., et al.: Exploring the complex pattern of information spreading in online blog communities. PLoS ONE 10(5), e0126894 (2015)

    Article  Google Scholar 

  2. Zhao, Z., Liu, Y., Wang, K.: An analysis of rumor propagation based on propagation force. Phys. A Stat. Mech. Appl. 443, 263–271 (2016)

    Article  MathSciNet  Google Scholar 

  3. Nekovee, M., Moreno, Y., Bianconi, G., Marsili, M.: Theory of rumor spreading in complex social networks. Phys. A Stat. Mech. Appl. 374, 457–470 (2007)

    Article  Google Scholar 

  4. Zhou, J., Liu, Z.H., Li, B.W.: Influence of network structure on rumor propagation. Phys. Lett. A 368, 458–463 (2007)

    Article  Google Scholar 

  5. Lind, P.G., da Silva, L.R., Andrade Jr., J.S., et al.: Spreading gossip in social networks. Phys. Rev. E 76(3), 036117 (2007)

    Article  Google Scholar 

  6. Afassinou, K.: Analysis of the impact of education rate on the rumor spreading mechanism. Phys. A Stat. Mech. Appl. 414, 43–52 (2014)

    Article  MathSciNet  Google Scholar 

  7. Cao, B., Han, S., Jin, Z.: Modeling of knowledge transmission considering forgetful level in complex networks. Phys. A Stat. Mech. Appl. 451, 277–287 (2016)

    Article  Google Scholar 

  8. Dong, S.Y.T., Fan, F.H., Huang, Y.C.: Studies on the population dynamics of a rumor-spreading model in online social networks. Phys. A Stat. Mech. Appl. 492, 10–20 (2018)

    Article  MathSciNet  Google Scholar 

  9. Rizzo, A., Frasca, M., Porfiri, M.: Effect of individual behavior on epidemic spreading in activity-driven networks. Phys. Rev. E 90, 042801 (2014)

    Article  Google Scholar 

  10. Centola, D.: The spread of behavior in an online social network experiment. Science 329(5996), 1194–1197 (2010)

    Article  Google Scholar 

  11. Ma, J., Li, D., Tian, Z.: Rumor spreading in online social networks by considering the bipolar social reinforcement. Phys. A Stat. Mech. Appl. 447, 108–115 (2016)

    Article  MathSciNet  Google Scholar 

  12. Han, S., Zhuang, F., He, Q., et al.: Energy model for rumor propagation on social networks. Phys. A Stat. Mech. Appl. 394, 99–109 (2014)

    Article  Google Scholar 

  13. Xu, J., Zhang, L., Ma, B., et al.: Impacts of suppressing guide on information spreading. Phys. A Stat. Mech. Appl. 444, 922–927 (2016)

    Article  Google Scholar 

  14. Wang, J., Zhao, L., Huang, R.: SIRaRu rumor spreading model in complex networks. Phys. A Stat. Mech. Appl. 398, 43–55 (2014)

    Article  MathSciNet  Google Scholar 

  15. Zhu, H., Ma, J.: Knowledge diffusion in complex networks by considering time-varying information channels. Phys. A Stat. Mech. Appl. 494, 225–235 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research has been supported by the National Natural Science Foundation of China (Grant No. 61802155 and 61672298), the National Social Science Foundation of China (Grant No. 13BTQ046), the High-level Introduction of Talent Scientific Research Start-up Fund of Jiangsu Police Institute (Grant No. JSPI17GKZL403), the Scientific Research Program of Jiangsu Police Institute (Grant No. 2017SJYZQ01) and the Research Foundation for Humanities and Social Sciences of Ministry of Education of China (Grant No. 15YJAZH016).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ling-Ling Xia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xia, LL., Song, B., Zhang, L. (2018). Rumor Spreading Model Considering Rumor’s Attraction in Heterogeneous Social Networks. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11067. Springer, Cham. https://doi.org/10.1007/978-3-030-00018-9_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00018-9_65

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00017-2

  • Online ISBN: 978-3-030-00018-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics