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

The competitive diffusion of knowledge and rumor in a multiplex network: A mathematical model

Author

Listed:
  • Huang, He
  • Pan, Jialin
  • Chen, Yahong

Abstract

The competition between rumor and knowledge has received significant attention from the global world. How to spread knowledge to better contain rumor has also become an important practical issue. In this study, we build a multi-compartment model in a multiplex network to study the competitive diffusion of knowledge and rumor. Two factors are emphasized in the model: penetration of knowledge into rumor, and spreading channel difference between knowledge and rumor. The model is further improved with the information-infected states divided into two sub-states: information-accepted and information-sharing. The mean-field method is adopted to analyze the model and then verified by the numerical results in both ER random networks and BA scale-free networks. The consistent results in ER and BA networks show that both rumor and knowledge thresholds are increased by the intensity of competition between them, and the rumor-knowledge competition goes through four phases: “no rumor and no knowledge”, “rumor outbreak and no knowledge” (rumor wins), “no rumor and knowledge outbreak” (knowledge wins), and “rumor vs knowledge” (rumor competes and coexists with knowledge), where the thresholds of rumor and knowledge act as the boundary of different phases. The different results in ER and BA networks show that rumor and knowledge are generally easier to break out in BA networks. But the BA rumor threshold may exceed the ER rumor threshold with the increase of rumor-knowledge competition, making rumor instead become difficult to break out in ER networks than that in BA networks, which infers that the hub nodes play very important roles in knowledge spreading. Based on the results, two types of management on rumor-knowledge competition are explored to control rumor and accelerate knowledge. Interestingly, critical values are discovered in both types of management, highlighting the importance of strengthening knowledge sharing and penetrating knowledge into rumor spreaders and listeners. The results reveal the management complexity of rumor-knowledge competition under different conditions.

Suggested Citation

  • Huang, He & Pan, Jialin & Chen, Yahong, 2024. "The competitive diffusion of knowledge and rumor in a multiplex network: A mathematical model," Applied Mathematics and Computation, Elsevier, vol. 475(C).
  • Handle: RePEc:eee:apmaco:v:475:y:2024:i:c:s0096300324001917
    DOI: 10.1016/j.amc.2024.128719
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001917
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2024.128719?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.

    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:475:y:2024:i:c:s0096300324001917. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.