IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5682543.html
   My bibliography  Save this article

Optimal Control of ISTR Rumor Propagation Model with Social Reinforcement in Heterogeneous Network

Author

Listed:
  • Liang’an Huo
  • Sijing Chen
  • Xiaoxiao Xie
  • Huiyuan Liu
  • Jianjia He
  • Xuzhen Zhu

Abstract

The wide spread of rumor is undoubtedly harmful to social stability; we should try to lower the effect of rumor on society. Therefore, it is reasonable to put forward the rumor control strategy on the basis of the study of the law of rumor propagation. Firstly, the ISTR model of rumor is established by including influencing factors of true information spreader and social reinforcement. And by using the next generation matrix method, the basic reproduction number of rumor is obtained. Then, in order to minimize the adverse effects of rumors, through introducing two control strategies of scientific knowledge popularization and refutation of rumors, the optimal control problem is established. And through using Pontryagin’s Minimum Principle, the optimal solution of the rumor propagation model is solved. Finally, through theoretical analysis and numerical simulation, some results can be obtained. The results show that adding true information spreaders into the rumor model can effectively control the rumor propagation, and social reinforcement plays a significance role in rumor. The results also prove that these two control strategies can effectively inhibit the propagation of rumors. With the addition of control strategies, the number of true information spreaders increases, while the number of rumor spreaders decreases.

Suggested Citation

  • Liang’an Huo & Sijing Chen & Xiaoxiao Xie & Huiyuan Liu & Jianjia He & Xuzhen Zhu, 2021. "Optimal Control of ISTR Rumor Propagation Model with Social Reinforcement in Heterogeneous Network," Complexity, Hindawi, vol. 2021, pages 1-15, December.
  • Handle: RePEc:hin:complx:5682543
    DOI: 10.1155/2021/5682543
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5682543.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5682543.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5682543?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
    ---><---

    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:hin:complx:5682543. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.