Epidemic models on lattices

Last updated
Spatial SIR model simulation. Each cell can infect its eight immediate neighbors. SIR model simulated using python.gif
Spatial SIR model simulation. Each cell can infect its eight immediate neighbors.

Classic epidemic models of disease transmission are described in Compartmental models in epidemiology. Here we discuss the behavior when such models are simulated on a lattice. Lattice models, which were first explored in the context of cellular automata, act as good first approximations of more complex spatial configurations, although they do not reflect the heterogeneity of space (e.g. population density differences, urban geography and topographical differentiations). [1] Lattice-based epidemic models can also be implemented as fixed agent-based models. [2]

Contents

Introduction

The mathematical modelling of epidemics was originally implemented in terms of differential equations, which effectively assumed that the various states of individuals were uniformly distributed throughout space. To take into account correlations and clustering, lattice-based models have been introduced. Grassberger [3] considered synchronous (cellular automaton) versions of models, and showed how the epidemic growth goes through a critical behavior such that transmission remains local when infection rates are below critical values, and spread throughout the system when they are above a critical value. Cardy and Grassberger [4] argued that this growth is similar to the growth of percolation clusters, which are governed by the "dynamical percolation" universality class (finished clusters are in the same class as static percolation, while growing clusters have additional dynamic exponents). In asynchronous models, the individuals are considered one at a time, as in kinetic Monte Carlo or as a "Stochastic Lattice Gas."[ citation needed ]

SIR model

In the "SIR" model, there are three states:

  • Susceptible (S) -- has not yet been infected, and has no immunity
  • Infected (I)-- currently "sick" and contagious to Susceptible neighbors
  • Removed (R), where the removal from further participation in the process is assumed to be permanent, due to immunization or death

It is to be distinguished from the "SIS" model, where sites recover without immunization, and are thus not "removed".

The asynchronous simulation of the model on a lattice is carried out as follows:

  • Pick a site. If it is I, then generate a random number x in (0,1).
  • If x < c then let I go to R.
  • Otherwise, pick one nearest neighbor randomly. If the neighboring site is S, then let it become I.
  • Repeat as long as there are S sites available.

Making a list of I sites makes this run quickly.

The net rate of infecting one neighbor over the rate of removal is λ = (1-c)/c.

For the synchronous model, all sites are updated simultaneously (using two copies of the lattice) as in a cellular automaton.

Latticezccλc = (1 - cc)/cc
2-d asynchronous SIR model triangular lattice60.199727(6) [5] 4.0068(2)
2-d asynchronous SIR model square lattice40.1765(5), [6] 0.1765005(10) [7] 4.66571(3)
2-d asynchronous SIR model honeycomb lattice30.1393(1) [5] 6.179(5)
2-d synchronous SIR model square lattice40.22 [8] 3.55
2-d asynchronous SIR model on Penrose lattice0.1713(2) [9]
2-d asynchronous SIR model on Ammann-Beenker lattice0.1732(5) [9]
2-d asynchronous SIR model on random Delaunay triangulations0.1963(3) [10]

Contact process (asynchronous SIS model)

I → S with unit rate; S → I with rate λnI/z where nI is the number of nearest neighbor I sites, and z is the total number of nearest neighbors (equivalently, each I attempts to infect one neighboring site with rate λ)

(Note: S → I with rate λn in some definitions, implying that lambda has one-fourth the values given here).

The simulation of the asynchronous model on a lattice is carried out as follows, with c = 1 / (1 + λ):

  • Pick a site. If it is I, then generate a random number x in (0,1).
  • If x < c then let I go to S.
  • Otherwise, pick one nearest neighbor randomly. If the neighboring site is S, then let it become I.
  • Repeat

Note that the synchronous version is related to the directed percolation model.

Latticezλc
1-d23.2978(2), [11] 3.29785(2) [12]
2-d square lattice41.6488(1), [13] 1.64874(2), [14] 1.64872(3), [11] 1.64877(3) [15]
2-d triangular lattice61.54780(5) [16]
2-d Delaunay triangulation of Voronoi Diagram6 (av)1.54266(4) [16]
3-d cubic lattice61.31685(10), [17] 1.31683(2), [11] 1.31686(1) [15]
4-d hypercubic lattice81.19511(1) [11]
5-d hypercubic lattice101.13847(1) [11]

See also

Related Research Articles

<span class="mw-page-title-main">Percolation theory</span> Mathematical theory on behavior of connected clusters in a random graph

In statistical physics and mathematics, percolation theory describes the behavior of a network when nodes or links are added. This is a geometric type of phase transition, since at a critical fraction of addition the network of small, disconnected clusters merge into significantly larger connected, so-called spanning clusters. The applications of percolation theory to materials science and in many other disciplines are discussed here and in the articles network theory and percolation.

<span class="mw-page-title-main">Percolation</span> Filtration of fluids through porous materials

In physics, chemistry, and materials science, percolation refers to the movement and filtering of fluids through porous materials. It is described by Darcy's law. Broader applications have since been developed that cover connectivity of many systems modeled as lattices or graphs, analogous to connectivity of lattice components in the filtration problem that modulates capacity for percolation.

In statistical mechanics, a universality class is a collection of mathematical models which share a single scale invariant limit under the process of renormalization group flow. While the models within a class may differ dramatically at finite scales, their behavior will become increasingly similar as the limit scale is approached. In particular, asymptotic phenomena such as critical exponents will be the same for all models in the class.

<span class="mw-page-title-main">Self-organized criticality</span> Concept in physics

Self-organized criticality (SOC) is a property of dynamical systems that have a critical point as an attractor. Their macroscopic behavior thus displays the spatial or temporal scale-invariance characteristic of the critical point of a phase transition, but without the need to tune control parameters to a precise value, because the system, effectively, tunes itself as it evolves towards criticality.

In physics, in the area of dynamical systems, the Olami–Feder–Christensen model is an earthquake model conjectured to be an example of self-organized criticality where local exchange dynamics are not conservative. Despite the original claims of the authors and subsequent claims of other authors such as Lise, whether or not the model is self organized critical remains an open question.

In statistical physics, directed percolation (DP) refers to a class of models that mimic filtering of fluids through porous materials along a given direction, due to the effect of gravity. Varying the microscopic connectivity of the pores, these models display a phase transition from a macroscopically permeable (percolating) to an impermeable (non-percolating) state. Directed percolation is also used as a simple model for epidemic spreading with a transition between survival and extinction of the disease depending on the infection rate.

<span class="mw-page-title-main">Rule 184</span> Elementary cellular automaton

Rule 184 is a one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:

The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability p, or more generally a critical surface for a group of parameters p1, p2, ..., such that infinite connectivity (percolation) first occurs.

<span class="mw-page-title-main">Subir Sachdev</span> Indian physicist

Subir Sachdev is Herchel Smith Professor of Physics at Harvard University specializing in condensed matter. He was elected to the U.S. National Academy of Sciences in 2014, and received the Lars Onsager Prize from the American Physical Society and the Dirac Medal from the ICTP in 2018. He was a co-editor of the Annual Review of Condensed Matter Physics from 2017-2019.

In the context of the physical and mathematical theory of percolation, a percolation transition is characterized by a set of universal critical exponents, which describe the fractal properties of the percolating medium at large scales and sufficiently close to the transition. The exponents are universal in the sense that they only depend on the type of percolation model and on the space dimension. They are expected to not depend on microscopic details such as the lattice structure, or whether site or bond percolation is considered. This article deals with the critical exponents of random percolation.

<span class="mw-page-title-main">Active matter</span> Matter behavior at system scale

Active matter is matter composed of large numbers of active "agents", each of which consumes energy in order to move or to exert mechanical forces. Such systems are intrinsically out of thermal equilibrium. Unlike thermal systems relaxing towards equilibrium and systems with boundary conditions imposing steady currents, active matter systems break time reversal symmetry because energy is being continually dissipated by the individual constituents. Most examples of active matter are biological in origin and span all the scales of the living, from bacteria and self-organising bio-polymers such as microtubules and actin, to schools of fish and flocks of birds. However, a great deal of current experimental work is devoted to synthetic systems such as artificial self-propelled particles. Active matter is a relatively new material classification in soft matter: the most extensively studied model, the Vicsek model, dates from 1995.

Maya Paczuski is the head and founder of the Complexity Science Group at the University of Calgary. She is a well-cited physicist whose work spans self-organized criticality, avalanche dynamics, earthquake, and complex networks. She was born in Israel in 1963, but grew up in the United States. Maya Paczuski received a B.S. and M.S. in Electrical Engineering and Computer Science from M.I.T. in 1986 and then went on to study with Mehran Kardar, earning her Ph.D in Condensed matter physics from the same institute.

Peter Grassberger is a professor (where?) who worked in statistical and particle physics. He made contributions to chaos theory, where he introduced the idea of correlation dimension, a means of measuring a type of fractal dimension of the strange attractor.

The Ziff–Gulari–Barshad (ZGB) model is a simple Monte Carlo method for catalytic reactions of oxidation of carbon monoxide to carbon dioxide on a surface using Monte-Carlo methods which captures correctly the essential dynamics: the phase transition between two poisoned states (either CO2- or O-poisoned) and a steady-state in between. It is named after Robert M. Ziff, Erdogan Gulari, and Yoav Barshad, who published it in 1986.

<span class="mw-page-title-main">Water retention on random surfaces</span> Study of water distribution

Water retention on random surfaces is the simulation of catching of water in ponds on a surface of cells of various heights on a regular array such as a square lattice, where water is rained down on every cell in the system. The boundaries of the system are open and allow water to flow out. Water will be trapped in ponds, and eventually all ponds will fill to their maximum height, with any additional water flowing over spillways and out the boundaries of the system. The problem is to find the amount of water trapped or retained for a given surface. This has been studied extensively for random surfaces.

<span class="mw-page-title-main">Global cascades model</span>

Global cascades models are a class of models aiming to model large and rare cascades that are triggered by exogenous perturbations which are relatively small compared with the size of the system. The phenomenon occurs ubiquitously in various systems, like information cascades in social systems, stock market crashes in economic systems, and cascading failure in physics infrastructure networks. The models capture some essential properties of such phenomenon.

Robustness, the ability to withstand failures and perturbations, is a critical attribute of many complex systems including complex networks.

<span class="mw-page-title-main">Random sequential adsorption</span>

Random sequential adsorption (RSA) refers to a process where particles are randomly introduced in a system, and if they do not overlap any previously adsorbed particle, they adsorb and remain fixed for the rest of the process. RSA can be carried out in computer simulation, in a mathematical analysis, or in experiments. It was first studied by one-dimensional models: the attachment of pendant groups in a polymer chain by Paul Flory, and the car-parking problem by Alfréd Rényi. Other early works include those of Benjamin Widom. In two and higher dimensions many systems have been studied by computer simulation, including in 2d, disks, randomly oriented squares and rectangles, aligned squares and rectangles, various other shapes, etc.

<span class="mw-page-title-main">Amnon Aharony</span> Physicist at Ben Gurion University in Israel

Amnon Aharony is an Israeli Professor (Emeritus) of Physics in the School of Physics and Astronomy at Tel Aviv University, Israel and in the Physics Department of Ben Gurion University of the Negev, Israel. After years of research on statistical physics, his current research focuses on condensed matter theory, especially in mesoscopic physics and spintronics. He is a member of the Israel Academy of Sciences and Humanities, a Foreign Honorary Member of the American Academy of Arts and Sciences and of several other academies. He also received several prizes, including the Rothschild Prize in Physical Sciences, and the Gunnar Randers Research Prize, awarded every other year by the King of Norway.

Replica cluster move in condensed matter physics refers to a family of non-local cluster algorithms used to simulate spin glasses. It is an extension of the Swendsen-Wang algorithm in that it generates non-trivial spin clusters informed by the interaction states on two replicas instead of just one. It is different from the replica exchange method, as it performs a non-local update on a fraction of the sites between the two replicas at the same temperature, while parallel tempering directly exchanges all the spins between two replicas at different temperature. However, the two are often used alongside to achieve state-of-the-art efficiency in simulating spin-glass models.

References

  1. ↑ von Csefalvay, Chris (2023), "Spatial dynamics of epidemics", Computational Modeling of Infectious Disease, Elsevier, pp. 257–303, doi:10.1016/b978-0-32-395389-4.00017-7, ISBN   978-0-323-95389-4 , retrieved 2023-03-02
  2. ↑ von Csefalvay, Chris (2023), "Agent-based modeling", Computational Modeling of Infectious Disease, Elsevier, pp. 305–375, doi:10.1016/b978-0-32-395389-4.00018-9, ISBN   978-0-323-95389-4 , retrieved 2023-03-02
  3. ↑ Grassberger, Peter (1983). "On the critical behavior of the general epidemic process and dynamical percolation". Mathematical Biosciences. 63 (2): 157–172. doi:10.1016/0025-5564(82)90036-0.
  4. ↑ Cardy, John; Grassberger, Peter (1985). "Epidemic models and percolation". J. Phys. A. 18 (6): L267. Bibcode:1985JPhA...18L.267C. doi:10.1088/0305-4470/18/6/001.
  5. 1 2 Tomé, Tânia; David de Souza; Robert M. Ziff (2013). "Correlations and thresholds for the SIR process on lattices". Preprint.
  6. ↑ de Souza, David; Tânia Tomé (2010). "Stochastic lattice gas model describing the dynamics of the SIRS epidemic process". Physica A. 389 (5): 1142–1150. arXiv: 0908.1296 . Bibcode:2010PhyA..389.1142D. doi:10.1016/j.physa.2009.10.039. S2CID   17145631.
  7. ↑ Tomé, Tânia; Robert Ziff (2010). "On the critical point of the Susceptible-Infected-Recovered model". Physical Review E. 82 (5): 051921. arXiv: 1006.2129 . Bibcode:2010PhRvE..82e1921T. doi:10.1103/PhysRevE.82.051921. PMID   21230514. S2CID   28861135.
  8. ↑ Arashiro, Everaldo; Tânia Tomé (2007). "The threshold of coexistence and critical behaviour of a predator–prey cellular automaton". J. Phys. A. 40 (5): 887–900. arXiv: cond-mat/0607360 . Bibcode:2007JPhA...40..887A. doi:10.1088/1751-8113/40/5/002. S2CID   54021762.
  9. 1 2 Santos, G. B. M.; Alves, T. F. A.; Alves, G. A.; Macedo-Filho, A. (2020). "Epidemic outbreaks on two-dimensional quasiperiodic lattices". Physics Letters A. 384 (2): 126063. arXiv: 1901.01403 . Bibcode:2020PhLA..38426063S. doi:10.1016/j.physleta.2019.126063. S2CID   119399157.
  10. ↑ Alves, T. F. A.; Alves, G. A.; Macedo-Filho, A. (2019-01-10). "Asynchronous SIR model on Two-Dimensional Random Delaunay Lattices". arXiv: 1901.03029 [cond-mat.stat-mech].
  11. 1 2 3 4 5 Sabag, Munir M. S.; Mário J. de Oliveira (2002). "Conserved contact process in one to five dimensions". Phys. Rev. E. 66 (3): 036115. Bibcode:2002PhRvE..66c6115S. doi:10.1103/PhysRevE.66.036115. PMID   12366192.
  12. ↑ Dickman, Ronald; I. Jensen (1993). "Time-dependent perturbation theory for non-equilibrium lattice models". J. Stat. Phys. 71 (1/2): 89–127. Bibcode:1993JSP....71...89J. CiteSeerX   10.1.1.540.2166 . doi:10.1007/BF01048090. S2CID   46519524.
  13. ↑ Moreira, Adriana; Ronald Dickman (1996). "Critical dynamics of the contact process with quenched disorder". Phys. Rev. E. 54 (4): R3090–R3093. arXiv: cond-mat/9604148 . Bibcode:1996PhRvE..54.3090M. doi:10.1103/PhysRevE.54.R3090. PMID   9965620. S2CID   15905118.
  14. ↑ Vojta, Thomas; Adam Fraquhar; Jason Mast (2009). "Infinite-randomness critical point in the two-dimensional disordered contact process". Phys. Rev. E. 79 (1): 011111. arXiv: 0810.1569 . Bibcode:2009PhRvE..79a1111V. doi:10.1103/PhysRevE.79.011111. PMID   19257005.
  15. 1 2 Dickman, Ronald (1999). "Reweighting in nonequilibrium simulations". Phys. Rev. E. 60 (3): R2441–R2444. arXiv: cond-mat/9902304 . Bibcode:1999PhRvE..60.2441D. doi:10.1103/PhysRevE.60.R2441. PMID   11970171. S2CID   17225358.
  16. 1 2 de Oliveira, Marcelo M.; S. G. Alves; S. C. Ferreira; Ronald Dickman (2008). "Contact process on a Voronoi triangulation". Phys. Rev. E. 78 (3): 031133. arXiv: 0810.0240 . Bibcode:2008PhRvE..78c1133D. doi:10.1103/PhysRevE.78.031133. PMID   18851019. S2CID   34027358.
  17. ↑ Moreira, Adriana G.; Ronald Dickman (1992). "Critical behavior of the three-dimensional contact process". Phys. Rev. E. 45 (2): R563–R566. Bibcode:1992PhRvA..45..563J. doi:10.1103/PhysRevA.45.R563. PMID   9907104.

Further reading

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.