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

SEIAR rumor spreading model with antagonistic states in hypernetworks

Author

Listed:
  • Li, Peng-Yue
  • Hu, Feng
  • Li, Fa-Xu
  • Zhao, You-Feng
  • Song, Yu-Rong

Abstract

Rumors pose serious harm to society, often affecting public safety and social stability as they spread. Most existing studies on rumor propagation models are based on binary relationships within ordinary graphs, constructing complex network information propagation models. However, these models struggle to capture the multi-dimensional, multi-attribute, and multi-relational complex interaction characteristics of real-world social networks. This paper proposes an SEIAR (Susceptible-Exposed-Informed-Antagonistic-Removed) rumor propagation model, built upon hypergraph theory, which effectively captures complex interaction relationships. The model builds on the SEIR framework by introducing a debunking state, enabling a more comprehensive reflection of the dynamic characteristics of rumor propagation and debunking behavior. Using mean-field theory, the dynamic equations of the SEIAR model are derived, along with an analytical expression for its basic reproduction number R0, and a stability analysis is conducted. The study shows that when R0≤1, the rumor-free equilibrium state of the model is locally and globally stable, ultimately leading to the disappearance of the rumor. When R0>1, the rumor persists and continues to spread. Numerical simulations using the Runge-Kutta method were performed to validate the effectiveness of the theoretical findings. Subsequently, the model was validated using actual rumor datasets, and the results showed that the model can effectively simulate the rumor propagation process in real social networks. In addition, this paper systematically analyzes the impact of factors such as the influence of debunkers, information control strength and control time, individual interests, information timeliness, and network structure on rumor propagation, and compares the propagation characteristics of different models through simulation. The model presented in this paper broadens the perspective of information propagation research, providing a detailed depiction of the rumor propagation mechanism that includes a debunking state, and offers significant theoretical support for developing rumor control strategies.

Suggested Citation

  • Li, Peng-Yue & Hu, Feng & Li, Fa-Xu & Zhao, You-Feng & Song, Yu-Rong, 2026. "SEIAR rumor spreading model with antagonistic states in hypernetworks," Applied Mathematics and Computation, Elsevier, vol. 508(C).
  • Handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003637
    DOI: 10.1016/j.amc.2025.129637
    as

    Download full text from publisher

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

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • R0 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General

    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:eee:apmaco:v:508:y:2026:i:c:s0096300325003637. 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.