IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v32y2021i03ns0129183121500352.html
   My bibliography  Save this article

Optimal control of a rumor model with group propagation over complex networks

Author

Listed:
  • Kalaiselvi Myilsamy

    (Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore - 641004, Tamil Nadu, India)

  • Muthukrishnan Senthil Kumar

    (Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore - 641004, Tamil Nadu, India)

  • Athira Satheesh Kumar

    (Department of Electrical Engineering, Indian Institute of Technology, Madras, India)

Abstract

Rumor is an unauthenticated statement that gives significant changes in the social life of the people, financial markets (stocks and trades), etc. By incorporating the dissemination of rumor through groups in social, mobile networks and by considering the people’s cognitive factor (hesitate and forget), a new model on the rumor spreading process is presented in this paper. The spreading dynamics of rumor in homogeneous and heterogeneous networks is analyzed by using mean-field theory. The reproduction number is obtained by using the next-generation matrix. The global stability of the rumor-free equilibrium for the homogeneous and heterogeneous model is proved elaborately. An optimal control problem is developed to minimize the hesitators and infected persons and the existence of optimality is shown using Pontryagin’s Minimum Principle. The hesitating and forgetting mechanism has a great impact on the model and is similar to the real-life. Further, the control parameters work superior in controlling the spreading of rumors. Finally, the numerical results are verified by the analytical results.

Suggested Citation

  • Kalaiselvi Myilsamy & Muthukrishnan Senthil Kumar & Athira Satheesh Kumar, 2021. "Optimal control of a rumor model with group propagation over complex networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 32(03), pages 1-27, March.
    • Handle: RePEc:wsi:ijmpcx:v:32:y:2021:i:03:n:s0129183121500352
    DOI: 10.1142/S0129183121500352
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183121500352
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183121500352?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:wsi:ijmpcx:v:32:y:2021:i:03:n:s0129183121500352. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.