IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v241y2026ipap513-527.html

Dynamics analysis of a Filippov ash infectious diseases model with a saturated incidence rate and delayed mortality

Author

Listed:
  • Zhang, Zhenjie
  • Yang, Ruizhi

Abstract

The prevention and control of ash tree infectious diseases is a significant challenge in forestry ecological protection. Aiming at the saturated incidence rate and delayed mortality in its disease transmission process, this paper constructs a Filippov model with a susceptible population threshold strategy, aiming to explore the regulatory mechanisms of such threshold control strategies and time delay and other factors on the dynamic behavior of the system. By analyzing the equilibrium points of subsystems and the characteristics of sliding mode dynamics, the study finds that changes in the value of the threshold can trigger complex behaviors such as system bifurcation, while changes in the time delay parameter significantly affect the stability of the system. Numerical simulations verify the interaction between these two parameters in disease transmission. In conclusion, precise regulation of the threshold and attention to the time delay effect are crucial for the effective prevention and control of ash tree infectious diseases. This study provides a theoretical basis for forestry disease management and highlights the value of a comprehensive prevention and control strategy that combines population density regulation and time delay effects.

Suggested Citation

  • Zhang, Zhenjie & Yang, Ruizhi, 2026. "Dynamics analysis of a Filippov ash infectious diseases model with a saturated incidence rate and delayed mortality," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PA), pages 513-527.
    • Handle: RePEc:eee:matcom:v:241:y:2026:i:pa:p:513-527
    DOI: 10.1016/j.matcom.2025.09.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425003866
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2025.09.014?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

    ;
    ;
    ;
    ;

    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:matcom:v:241:y:2026:i:pa:p:513-527. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.