IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0224177.html
   My bibliography  Save this article

Information diffusion in signed networks

Author

Listed:
  • Xiaochen He
  • Haifeng Du
  • Marcus W Feldman
  • Guangyu Li

Abstract

Information diffusion has been widely discussed in various disciplines including sociology, economics, physics or computer science. In this paper, we generalize the linear threshold model in signed networks consisting of both positive and negative links. We analyze the dynamics of the spread of information based on balance theory, and find that a signed network can generate path dependence while structural balance can help remove the path dependence when seeded with balanced initialized active nodes. Simulation shows that the diffusion of information based on positive links contradicts that based on negative links. More positive links in signed networks are more likely to activate nodes and remove path dependence, but they can reduce predictability that is based on active states. We also find that a balanced structure can facilitate both the magnitude and speed of information diffusion, remove the path dependence, and cause polarization.

Suggested Citation

  • Xiaochen He & Haifeng Du & Marcus W Feldman & Guangyu Li, 2019. "Information diffusion in signed networks," PLOS ONE, Public Library of Science, vol. 14(10), pages 1-21, October.
    • Handle: RePEc:plo:pone00:0224177
    DOI: 10.1371/journal.pone.0224177
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0224177
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0224177&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0224177?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
    ---><---

    References listed on IDEAS

    as
    1. Du, Haifeng & He, Xiaochen & Wang, Jingjing & Feldman, Marcus W., 2018. "Reversing structural balance in signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 780-792.
    2. Joe A. Dodson, Jr. & Eitan Muller, 1978. "Models of New Product Diffusion Through Advertising and Word-of-Mouth," Management Science, INFORMS, vol. 24(15), pages 1568-1578, November.
    3. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    4. Francisco C Santos & Jorge M Pacheco & Tom Lenaerts, 2006. "Cooperation Prevails When Individuals Adjust Their Social Ties," PLOS Computational Biology, Public Library of Science, vol. 2(10), pages 1-8, October.
    5. Xiaochen He & Haifeng Du & Meng Cai & Marcus W Feldman, 2018. "The evolution of cooperation in signed networks under the impact of structural balance," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-18, October.
    Full references (including those not matched with items on IDEAS)

    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. Babutsidze, Zakaria, 2018. "The rise of electronic social networks and implications for advertisers," Technological Forecasting and Social Change, Elsevier, vol. 137(C), pages 27-39.
    2. repec:hal:spmain:info:hdl:2441/7eeckjdtj29ncak518t23a2j25 is not listed on IDEAS
    3. Song, Shenpeng & Feng, Yuhao & Xu, Wenzhe & Li, Hui-Jia & Wang, Zhen, 2022. "Evolutionary prisoner’s dilemma game on signed networks based on structural balance theory," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    4. Oscar Gutiérrez & Francisco Ruiz-Aliseda, 2011. "Real options with unknown-date events," Annals of Finance, Springer, vol. 7(2), pages 171-198, May.
    5. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    6. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    7. Supriya Tiwari & Pallavi Basu, 2024. "Quasi-randomization tests for network interference," Papers 2403.16673, arXiv.org.
    8. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    9. Te Wu & Feng Fu & Long Wang, 2011. "Moving Away from Nasty Encounters Enhances Cooperation in Ecological Prisoner's Dilemma Game," PLOS ONE, Public Library of Science, vol. 6(11), pages 1-7, November.
    10. Zhang, Jianlei & Zhang, Chunyan & Chu, Tianguang, 2011. "The evolution of cooperation in spatial groups," Chaos, Solitons & Fractals, Elsevier, vol. 44(1), pages 131-136.
    11. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    12. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    13. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    14. Ferreira, D.S.R. & Ribeiro, J. & Oliveira, P.S.L. & Pimenta, A.R. & Freitas, R.P. & Dutra, R.S. & Papa, A.R.R. & Mendes, J.F.F., 2022. "Spatiotemporal analysis of earthquake occurrence in synthetic and worldwide data," Chaos, Solitons & Fractals, Elsevier, vol. 165(P2).
    15. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    16. Qinghu Liao & Wenwen Dong & Boxin Zhao, 2023. "A New Strategy to Solve “the Tragedy of the Commons” in Sustainable Grassland Ecological Compensation: Experience from Inner Mongolia, China," Sustainability, MDPI, vol. 15(12), pages 1-24, June.
    17. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    18. Xueguo Xu & Chen Xu & Wenxin Zhang, 2022. "Research on the Destruction Resistance of Giant Urban Rail Transit Network from the Perspective of Vulnerability," Sustainability, MDPI, vol. 14(12), pages 1-26, June.
    19. Michael Foley & Rory Smead & Patrick Forber & Christoph Riedl, 2021. "Avoiding the bullies: The resilience of cooperation among unequals," PLOS Computational Biology, Public Library of Science, vol. 17(4), pages 1-18, April.
    20. Jianhong Chen & Hongcai Ma & Shan Yang, 2023. "SEIOR Rumor Propagation Model Considering Hesitating Mechanism and Different Rumor-Refuting Ways in Complex Networks," Mathematics, MDPI, vol. 11(2), pages 1-22, January.
    21. Xiaokun Su & Chenrouyu Zheng & Yefei Yang & Yafei Yang & Wen Zhao & Yue Yu, 2022. "Spatial Structure and Development Patterns of Urban Traffic Flow Network in Less Developed Areas: A Sustainable Development Perspective," Sustainability, MDPI, vol. 14(13), pages 1-18, July.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0224177. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.