Complete hierarchies of SIR models on arbitrary networks with exact and approximate moment closure

Exact solutions and bounds for network SIR and SEIR models using a rooted-tree approximation

In this paper, we develop a new node-based approximate model to describe contagion dynamics on networks. We prove that our approximate model is exact for Markovian SIR (susceptible-infectious-recovered) and SEIR (susceptible-exposed-infectious-recovered) dynamics on tree graphs with a single source of infection, and that the model otherwise gives upper bounds on the probabilities of each node being susceptible. Our analysis of SEIR contagion dynamics is general to SEIR models with arbitrarily many classes of exposed/latent state. In all cases of a tree graph with a single source of infection, our approach yields a system of linear differential equations that exactly describes the evolution of node-state probabilities; we use this to state explicit closed-form solutions for an SIR model on a tree. For more general networks, our approach yields a cooperative system of differential equations that can be used to bound the true solution.

Mean-field models of dynamics on networks via moment closure: An automated procedure

In the study of dynamics on networks, moment closure is a commonly used method to obtain low-dimensional evolution equations amenable to analysis. The variables in the evolution equations are mean counts of subgraph states and are referred to as moments. Due to interaction between neighbors, each moment equation is a function of higher-order moments, such that an infinite hierarchy of equations arises. Hence, the derivation requires truncation at a given order and an approximation of the highest-order moments in terms of lower-order ones, known as a closure formula. Recent systematic approximations have either restricted focus to closed moment equations for SIR epidemic spreading or to unclosed moment equations for arbitrary dynamics. In this paper, we develop a general procedure that automates both derivation and closure of arbitrary order moment equations for dynamics with nearest-neighbor interactions on undirected networks. Automation of the closure step was made possible by our generalized closure scheme, which systematically decomposes the largest subgraphs into their smaller components. We show that this decomposition is exact if these components form a tree, there is independence at distances beyond their graph diameter, and there is spatial homogeneity. Testing our method for SIS epidemic spreading on lattices and random networks confirms that biases are larger for networks with many short cycles in regimes with long-range dependence. A Mathematica package that automates the moment closure is available for download.

Equilibrium properties of the spatial SIS model as a point pattern dynamics - How is infection distributed over space?

We revisit the classical epidemiological SIS model as a stochastic point pattern dynamics with special focus on its spatial distribution at equilibrium. In this model, each point on a continuous space is either susceptible S or infectious I, and infection occurs with an infection kernel as a function of distance from I to S. This stochastic process has been mathematically described by the hierarchical dynamics of the probabilities that a point, a pair made by two points, and a triplet made by three points, etc., is in a specific configuration of status. Using a simple closure thereby triplet probabilities that appear in the dynamics are approximated, we show that the average singlet probabilities and the pair probabilities that describe spatial distributions of Ss and Is at equilibrium can be explicitly derived using the infection kernel; Is are spatially clustered in the same order of the infection kernel. The results highlight the advantage of point pattern approach to model spatial population dynamics in general ecology where local interactions among individuals likely depend on distance between them.

Methods for approximating stochastic evolutionary dynamics on graphs

Population structure can have a significant effect on evolution. For some systems with sufficient symmetry, analytic results can be derived within the mathematical framework of evolutionary graph theory which relate to the outcome of the evolutionary process. However, for more complicated heterogeneous structures, computationally intensive methods are required such as individual-based stochastic simulations. By adapting methods from statistical physics, including moment closure techniques, we first show how to derive existing homogenised pair approximation models and the exact neutral drift model. We then develop node-level approximations to stochastic evolutionary processes on arbitrarily complex structured populations represented by finite graphs, which can capture the different dynamics for individual nodes in the population. Using these approximations, we evaluate the fixation probability of invading mutants for given initial conditions, where the dynamics follow standard evolutionary processes such as the invasion process. Comparisons with the output of stochastic simulations reveal the effectiveness of our approximations in describing the stochastic processes and in predicting the probability of fixation of mutants on a wide range of graphs. Construction of these models facilitates a systematic analysis and is valuable for a greater understanding of the influence of population structure on evolutionary processes.

Systematic Approximations to Susceptible-Infectious-Susceptible Dynamics on Networks

Network-based infectious disease models have been highly effective in elucidating the role of contact structure in the spread of infection. As such, pair- and neighbourhood-based approximation models have played a key role in linking findings from network simulations to standard (random-mixing) results. Recently, for SIR-type infections (that produce one epidemic in a closed population) on locally tree-like networks, these approximations have been shown to be exact. However, network models are ideally suited for Sexually Transmitted Infections (STIs) due to the greater level of detail available for sexual contact networks, and these diseases often possess SIS-type dynamics. Here, we consider the accuracy of three systematic approximations that can be applied to arbitrary disease dynamics, including SIS behaviour. We focus in particular on low degree networks, in which the small number of neighbours causes build-up of local correlations between the state of adjacent nodes that are challenging to capture. By examining how and when these approximation models converge to simulation results, we generate insights into the role of network structure in the infection dynamics of SIS-type infections.

Networks are now widely used to model infectious diseases, but have posed significant mathematical challenges. Recently analytic results have been obtained for ‘one-off’ network epidemics that follow the SIR paradigm, but these results do not carry over to other scenarios—most significantly to many sexually transmitted infections, where accounting for network structure is vital. Here, we show that it is possible to obtain the large-population dynamics of such diseases on networks through systematic approximations. We focus on a mathematically challenging case of SIS dynamics on networks with low degree.

Discrete-time moment closure models for epidemic spreading in populations of interacting individuals

Understanding the dynamics of spread of infectious diseases between individuals is essential for forecasting the evolution of an epidemic outbreak or for defining intervention policies. The problem is addressed by many approaches including stochastic and deterministic models formulated at diverse scales (individuals, populations) and different levels of detail. Here we consider discrete-time SIR (susceptible-infectious-removed) dynamics propagated on contact networks. We derive a novel set of 'discrete-time moment equations' for the probability of the system states at the level of individual nodes and pairs of nodes. These equations form a set which we close by introducing appropriate approximations of the joint probabilities appearing in them. For the example case of SIR processes, we formulate two types of model, one assuming statistical independence at the level of individuals and one at the level of pairs. From the pair-based model we then derive a model at the level of the population which captures the behavior of epidemics on homogeneous random networks. With respect to their continuous-time counterparts, the models include a larger number of possible transitions from one state to another and joint probabilities with a larger number of individuals. The approach is validated through numerical simulation over different network topologies.