IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v357y2019icp167-184.html
   My bibliography  Save this article

The number of followings as an influential factor in rumor spreading

Author

Listed:
  • Bodaghi, Amirhosein
  • Goliaei, Sama
  • Salehi, Mostafa

Abstract

In this paper, we hypothesize that the number of followings users have on social networks, has an influence on the impact level of the received rumor/anti-rumor messages by those users. We show that influence as a decreasing exponential coefficient on the probabilities by which users' might get affected from the received messages. Then we put forward another hypothesis that suggests that rumor/anti-rumor posts gradually lose their impact power by passage of time. To assign this time-related feature to the posts, we consider a memory for each agent of the network. Finally, we derive stochastic equations of the new model which incorporate both of the new hypotheses and then evaluate it based on real datasets of rumor spreading on Twitter. The evaluation results support the new hypotheses and show that the novel model is able to better represent rumor spreading on online social networks.

Suggested Citation

  • Bodaghi, Amirhosein & Goliaei, Sama & Salehi, Mostafa, 2019. "The number of followings as an influential factor in rumor spreading," Applied Mathematics and Computation, Elsevier, vol. 357(C), pages 167-184.
    • Handle: RePEc:eee:apmaco:v:357:y:2019:i:c:p:167-184
    DOI: 10.1016/j.amc.2019.04.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319302814
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.04.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Javier Borge-Holthoefer & Pablo Piedrahita & Alex Arenas, 2018. "Evolving activity cascades on socio-technological networks," Journal of Computational Social Science, Springer, vol. 1(1), pages 67-79, January.
    2. Cangqi Zhou & Qianchuan Zhao & Wenbo Lu, 2015. "Impact of Repeated Exposures on Information Spreading in Social Networks," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-21, October.
    3. Zhao, Zhen-jun & Liu, Yong-mei & Wang, Ke-xi, 2016. "An analysis of rumor propagation based on propagation force," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 263-271.
    4. Jie, Renlong & Qiao, Jian & Xu, Genjiu & Meng, Yingying, 2016. "A study on the interaction between two rumors in homogeneous complex networks under symmetric conditions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 454(C), pages 129-142.
    5. Isham, Valerie & Harden, Simon & Nekovee, Maziar, 2010. "Stochastic epidemics and rumours on finite random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(3), pages 561-576.
    6. Liu, Wanping & Wu, Xiao & Yang, Wu & Zhu, Xiaofei & Zhong, Shouming, 2019. "Modeling cyber rumor spreading over mobile social networks: A compartment approach," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 214-229.
    7. Wang, Zhishuang & Guo, Quantong & Sun, Shiwen & Xia, Chengyi, 2019. "The impact of awareness diffusion on SIR-like epidemics in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 134-147.
    8. Li, Chao & Wang, Li & Sun, Shiwen & Xia, Chengyi, 2018. "Identification of influential spreaders based on classified neighbors in real-world complex networks," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 512-523.
    9. Amirhosein Bodaghi & Sama Goliaei, 2018. "A Novel Model For Rumor Spreading On Social Networks With Considering The Influence Of Dissenting Opinions," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 21(06n07), pages 1-24, September.
    10. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    11. Nekovee, M. & Moreno, Y. & Bianconi, G. & Marsili, M., 2007. "Theory of rumour spreading in complex social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 374(1), pages 457-470.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Meiling Jin & Fengming Liu & Yufu Ning & Yichang Gao & Dongmei Li, 2024. "A Mathematical Optimization Model Designed to Determine the Optimal Timing of Online Rumor Intervention Based on Uncertainty Theory," Mathematics, MDPI, vol. 12(16), pages 1-21, August.
    2. Haji Gul & Feras Al-Obeidat & Adnan Amin & Fernando Moreira & Kaizhu Huang, 2022. "Hill Climbing-Based Efficient Model for Link Prediction in Undirected Graphs," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    3. Ke, Yue & Zhu, Linhe & Wu, Peng & Shi, Lei, 2022. "Dynamics of a reaction-diffusion rumor propagation model with non-smooth control," Applied Mathematics and Computation, Elsevier, vol. 435(C).
    4. Wang, Jinling & Jiang, Haijun & Hu, Cheng & Yu, Zhiyong & Li, Jiarong, 2021. "Stability and Hopf bifurcation analysis of multi-lingual rumor spreading model with nonlinear inhibition mechanism," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    5. Li, Dandan & Qian, Wenqi & Sun, Xiaoxiao & Han, Dun & Sun, Mei, 2023. "Rumor spreading in a dual-relationship network with diverse propagation abilities," Applied Mathematics and Computation, Elsevier, vol. 458(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Amirhosein Bodaghi & Sama Goliaei, 2018. "A Novel Model For Rumor Spreading On Social Networks With Considering The Influence Of Dissenting Opinions," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 21(06n07), pages 1-24, September.
    2. Huo, Liang’an & Chen, Sijing, 2020. "Rumor propagation model with consideration of scientific knowledge level and social reinforcement in heterogeneous network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).
    3. Huang, He & Chen, Yahong & Ma, Yefeng, 2021. "Modeling the competitive diffusions of rumor and knowledge and the impacts on epidemic spreading," Applied Mathematics and Computation, Elsevier, vol. 388(C).
    4. Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    5. Zan, Yongli & Wu, Jianliang & Li, Ping & Yu, Qinglin, 2014. "SICR rumor spreading model in complex networks: Counterattack and self-resistance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 159-170.
    6. Zhang, Yaming & Su, Yanyuan & Weigang, Li & Liu, Haiou, 2019. "Interacting model of rumor propagation and behavior spreading in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 121(C), pages 168-177.
    7. Lu, Peng, 2019. "Heterogeneity, judgment, and social trust of agents in rumor spreading," Applied Mathematics and Computation, Elsevier, vol. 350(C), pages 447-461.
    8. Ran, Maojie & Chen, Jiancu, 2021. "An information dissemination model based on positive and negative interference in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    9. Yao, Yao & Xiao, Xi & Zhang, Chengping & Dou, Changsheng & Xia, Shutao, 2019. "Stability analysis of an SDILR model based on rumor recurrence on social media," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    10. Jinxian Li & Yanping Hu & Zhen Jin, 2019. "Rumor Spreading of an SIHR Model in Heterogeneous Networks Based on Probability Generating Function," Complexity, Hindawi, vol. 2019, pages 1-15, June.
    11. Agryzkov, Taras & Tortosa, Leandro & Vicent, Jose F., 2019. "A variant of the current flow betweenness centrality and its application in urban networks," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 600-615.
    12. Wang, Weiping & Guo, Junjiang & Wang, Zhen & Wang, Hao & Cheng, Jun & Wang, Chunyang & Yuan, Manman & Kurths, Jürgen & Luo, Xiong & Gao, Yang, 2021. "Abnormal flow detection in industrial control network based on deep reinforcement learning," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    13. Keng, Ying Ying & Kwa, Kiam Heong & Ratnavelu, Kurunathan, 2021. "Centrality analysis in a drug network and its application to drug repositioning," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    14. Guilherme Ferraz de Arruda & Lucas G. S. Jeub & Angélica S. Mata & Francisco A. Rodrigues & Yamir Moreno, 2022. "From subcritical behavior to a correlation-induced transition in rumor models," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    15. Zhang, Jun-li & Fu, Yan-jun & Cheng, Lan & Yang, Yun-yun, 2021. "Identifying multiple influential spreaders based on maximum connected component decomposition method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    16. Giacopelli, G. & Migliore, M. & Tegolo, D., 2020. "Graph-theoretical derivation of brain structural connectivity," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    17. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    18. Li, Xiaopeng & Sun, Shiwen & Xia, Chengyi, 2019. "Reputation-based adaptive adjustment of link weight among individuals promotes the cooperation in spatial social dilemmas," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 810-820.
    19. Wang, Zhishuang & Guo, Quantong & Sun, Shiwen & Xia, Chengyi, 2019. "The impact of awareness diffusion on SIR-like epidemics in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 134-147.
    20. Curado, Manuel & Tortosa, Leandro & Vicent, Jose F., 2021. "Identifying mobility patterns by means of centrality algorithms in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 406(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:357:y:2019:i:c:p:167-184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.