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

Tensor product approach to modelling epidemics on networks

Author

Listed:
  • Dolgov, Sergey
  • Savostyanov, Dmitry

Abstract

To improve mathematical models of epidemics it is essential to move beyond the traditional assumption of homogeneous well–mixed population and involve more precise information on the network of contacts and transport links by which a stochastic process of the epidemics spreads. In general, the number of states of the network grows exponentially with its size, and a master equation description suffers from the curse of dimensionality. Almost all methods widely used in practice are versions of the stochastic simulation algorithm (SSA), which is notoriously known for its slow convergence. In this paper we numerically solve the chemical master equation for an SIR model on a general network using recently proposed tensor product algorithms. In numerical experiments we show that tensor product algorithms converge much faster than SSA and deliver more accurate results, which becomes particularly important for uncovering the probabilities of rare events, e.g. for number of infected people to exceed a (high) threshold.

Suggested Citation

  • Dolgov, Sergey & Savostyanov, Dmitry, 2024. "Tensor product approach to modelling epidemics on networks," Applied Mathematics and Computation, Elsevier, vol. 460(C).
    • Handle: RePEc:eee:apmaco:v:460:y:2024:i:c:s0096300323004599
    DOI: 10.1016/j.amc.2023.128290
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323004599
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128290?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:460:y:2024:i:c:s0096300323004599. 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.