Equivalence of Mass Action and Poisson Network SIR Epidemic Models
Abstract
This brief note highlights a largely overlooked similarity between the SIR ordinary differential equations used for epidemics on the configuration model of a Poisson network and the classical mass-action SIR equations introduced nearly a century ago by Kermack and McKendrick. We demonstrate that the decline pattern in susceptibles is identical for both models. This equivalence carries practical implications: the susceptibles decay curve, often referred to as the epidemic or incidence curve, is frequently used in empirical studies to forecast epidemic dynamics. Although the curves for susceptibles align perfectly, those for infections do differ. Yet, the infection curves tend to converge and become almost indistinguishable in high-degree networks. In summary, our analysis suggests that under many practical scenarios, it’s acceptable to use the classical SIR model as a close approximation to the Poisson SIR network model.
Index Terms:
Configuration model; SIR epidemic equations; Kermack-McKendrick model;I Introduction
In many practical situations, especially during the recent COVID-19 pandemic, it has been suggested that the classical susceptible-infected-recovered (SIR) equations are robust in the sense that they can accurately depict a wide range of epidemic scenarios, accounting for both heterogeneity of contacts and variations in the infection process. In this brief note, we will consider one of the surprising examples of this, analyzing an interesting and apparently little-known relation between the classical SIR models and the network versions of SIR epidemics. As it turns out, in certain situations, the classical SIR equations are also valid when describing dynamics on specific networks. This fact is somewhat surprising and, at least to some extent, could explain the notable resilience of the classical SIR models, even when they are considered outside the assumptions they were originally based on or in the areas seemingly far removed from mathematical epidemiology, like political science and chemical kinetics [1, 2]. Even though the analysis considered here can be extended more broadly, for simplicity we specifically focus on an example involving a relatively simple network known as the configuration model graph with a given degree distribution. For a more comprehensive review of such models in the context of epidemics and more, refer to the monographs [3], or [4]. In the remainder of this section, we briefly recall the basic notions relevant to our discussion. The most important results can be found in Section 2, where we establish the equivalence between non-network and network SIR models.
I-A Classical SIR Model
The SIR model, proposed famously by Kermack and McKendrick in [5], offers a foundational mathematical approach to understand the dynamics of infectious diseases. Within this model, individuals in a population are grouped into three compartments: susceptible, infected and recovered, with their temporal proportions denoted usually by , , and , respectively. The time progression of these compartments is detailed by the subsequent ordinary differential equations:
(1) | ||||
(2) | ||||
(3) |
Herein, denotes the rate of infection, representing the frequency at which susceptible individuals become infected upon encountering infected ones. Conversely, denotes the recovery rate, defining the pace at which infected individuals recuperate or succumb, subsequently departing from the infected category. The initial conditions for the above system are taken as
(4) | ||||
A pivotal parameter in epidemiology is the basic reproduction number, , defined as:
(5) |
This value serves as an indicator of the potential for an outbreak. When , it suggests that the epidemic can spread in the population. It’s important to note that these equations inherently assume the law of mass action, without a specific contact structure or, in other words, homogenous interactions among all individuals. This implies that an individual who is infectious can potentially infect any other susceptible individual.
I-B Network SIR Models
In real-world populations, interactions among individuals are not homogeneous, a simplifying assumption inherent to classical SIR models. In reality, individuals form complex interaction patterns, often described best as networks. These networks, where nodes represent individuals and edges denote interactions or contacts, embody the diverse and intricate structure of relationships within populations. For instance, some individuals, often called ’super-spreaders’, have a disproportionately high number of connections, making them more likely to spread infections. Others may have limited interactions and are consequently less exposed. This variability in connectivity is not represent in the system (1)–(3). By extending the classical SIR model to networks, we can capture these heterogeneities, providing a more accurate representation of disease spread. This network-based perspective has given rise to network versions of the SIR differential equations, offering more nuanced insights into outbreak dynamics in structured populations. Notable among these models are the pairwise (PW) model [6, 7], the Volz model [8], and the dynamical survival analysis (DSA) model [9, 10].
The PW model, as detailed in [6, 7], provides equations that predict the expected number of susceptible nodes and infected nodes, along with the anticipated number of and pairs. This model employs a closure technique that predicts the expected number of triples using singles and pairs, eliminating the need to rely on higher-order moments.
On the other hand, the Volz model [8] relies on a differential equation system described via the probability generating function (PGF) of the degree distribution. Unlike other models, it focuses on edge-centric metrics, like the count of edges connecting nodes in specific states, instead of node-centric metrics such as counts of infected or susceptible nodes. This model’s results align closely with simulations. Furthermore, Decreusefond and colleagues have formally demonstrated that if is the number of network nodes, the Volz model represents the large limit for a stochastic SIR epidemic on a configuration model network [11].
I-C DSA Model and Poisson-type Networks
In a more recent study, Jacobsen and colleagues introduced an alternative approach for deriving the mean-field limit of a stochastic SIR model on a network, which is often referred to the dynamical survival analysis (DSA) approach [9, 12]. Although the variables analyzed in this approach differ from those in the Volz model, the two limiting network dynamics were shown to be equivalent [12]. Moreover, the DSA framework offers a fresh perspective on epidemics by allowing us to see them through a statistical lens, for instance, by estimating the likelihood that a standard node, which was susceptible at time , remains susceptible at any time .
It turns out that all three models (PW, Volz and DSA) take a particularly simple and mutually equivalent form when the network degree distributions belong to the so-called Poisson-type class of distributions consisting of the Poisson, negative binomial, and binomial families of distributions [9, 12, 13]. For that class, the large network equations may be described in terms of the limiting proportions of -type nodes (), pairs (), and the infection density [14].
The essence of the simplification for the Poisson-type networks is that the limiting equations involve only these quantities along with the proportion of infected as follows :
(6) | ||||
with the set of initial conditions
(7) | ||||
For simplicity, we omit here the dynamics of recovery, which is the same as in the classical model (3). Note that the constants and represent the rates of infection and recovery, with representing the initial amount of infection. The quantities and are network-related and represent, respectively, the average of the network degree and the ratio of the average degree to the average excess degree. Recall that the excess degree distribution on a configuration model random graph with degree distribution and average degree is defined as the degree of a random neighbor node of a randomly selected node of degree at least one. That is, . For the network SIR model (6), the basic reproduction number (5) needs to be redefined to reflect the added heterogeneity. To avoid ambiguity, we denote this basic reproduction number by and the basic reproduction number given in (5) by . The network basic reproduction number is then
(8) |
and reflects the somewhat intuitive notion that the average number of new infections has to be proportional to the average of the degree distribiution.
II Models Equivalence
Let us consider the case of a Poisson network, that is, the special case when for are Poisson probabilities. In this case it is easy to see that we have and thus . Consequently, the network equations (6) simplify to
(9) | ||||
(10) | ||||
(11) |
with the same set of initial conditions (7). These equations may be manipulated in order to yield only a single equation describing the dynamics of susceptibles known as the epidemic curve equation.
II-A Epidemic Curve Equations
Dividing (10) by (9) we obtain
and therefore (applying the initial conditions (7)) we get
(12) |
Substituting this expression into (9) we obtain the following differential equation which involves only
(13) |
The equation above inherits the initial condition from (6) and is seen as describing the rate of decay of the susceptible population in terms of the number of susceptibles only. It is especially relevant to analyzing new infections or the incidence rate of an epidemic. The quantity is therefore often referred to as the epidemic curve. If we think about the quantity as the survival probability for susceptibles (that is, the probability of a randomly selected initially susceptible avoiding infection by time , see, e.g., [12]) then the epidemic curve may be also viewed as the density of infection, see, e.g., [13]. An example of the survival curve and the corresponding density of infection (or epidemic curve) is presented in Figure 1.

The equation (13) can be also used as a convenient way of comparing the dynamics of the Poisson network SIR model (9)-(11) with that of the classical (mass action) SIR model (1)-(3). Indeed, note that since the algebraic structures of the right hand sides of the differentrial equations (9)-(10) and (1)-(2) are identical, the same manipulation as for the former may also be used for the latter, leading to the mass action epidemic curve equation
(14) |
The equations (14) and (13) both describe the epidemic curve, they use however different assumptions on the population contact structure, namely the mass action and Poisson degree distribution, respectively. The two equations are seen to be equivalent if and only if the appropriate parameter values coincide. Note also that in this case but . Let us formulate this as follows.
Theorem 1.
Assume that we wish to approximate the dynamics of a Poisson network SIR epidemic given by (9)-(11) and (7) using the classical SIR mass action model (1)-(3) and (4). The two models respective epidemic curve equations coincide iff , , and . In this case , , and . Moreover, if the true amount of infection under network model satisfies
(15) |
where the correction factor is given by
∎
The result above indicates that it is reasonable to analyze the epidemic curve on the Poisson network using the classical SIR equations (1)-(3). This will lead to the correct dynamics of the incidence (infection density) given by curve. However, in order to correctly calculate the number of infections , the classical equation (2) needs to be replaced by the corrected one as given in (15). The discrepancy will depend on the values of the parameters but may be considerable as illustrated in Figure 2. However, for large we see that and the discrepancy becomes negligible in practice.

III Conclusions
Network-based epidemic models often employ random graphs with Poisson degree distributions. This choice is grounded in the widely applied Poisson approximation of the binomial distribution, as applied to the basic Erdös-Rényi graph model. Personal network analysis based on such random graphs has gained prominence in modeling disease spread, a relevance accentuated by the recent COVID-19 pandemic. In this note, we pointed out to the surprising equivalence between the classical Kermack and McKendrick SIR model and its Poisson network counterpart. Our result stated in Theorem 1 indicates that SIR epidemics for Poisson networks, particularly those with a high degree, can be effectively represented using the traditional mass-action SIR dynamics. This compatibility is evident in epidemic curves and infection magnitude analyses as illustrated in our Theorem 1. The observed congruence between the classical and network-based SIR models offers a valuable perspective for models simplification especially for the high-degree Poisson networks that became especially relevant in assessing proximity-based transmission during COVID-19 pandemic. While the insights presented here are directly relevant to epidemiology, they also have implications in other fields, including social networks analysis and modeling dynamics of experimental systems in chemical physics.
References
- [1] A. Volkening, D. F. Linder, M. A. Porter, and G. A. Rempala, “Forecasting elections using compartmental models of infection,” SIAM Review, vol. 62, no. 4, pp. 837–865, 2020.
- [2] H.-W. Kang, W. R. KhudaBukhsh, H. Koeppl, and G. A. Rempała, “Quasi-steady-state approximations derived from the stochastic model of enzyme kinetics,” Bulletin of mathematical biology, vol. 81, pp. 1303–1336, 2019.
- [3] R. Van Der Hofstad, Random graphs and complex networks. Cambridge university press, 2016, vol. 43.
- [4] I. Z. Kiss, J. C. Miller, and P. L. Simon, “Mathematics of epidemics on networks,” Cham: Springer, vol. 598, p. 31, 2017.
- [5] W. O. Kermack and A. G. McKendrick, “A contribution to the mathematical theory of epidemics,” Royal Society of London Proceedings Series A, vol. 115, pp. 700–721, Aug. 1927.
- [6] D. Rand, “Correlation equations and pair approximations for spatial ecologies,” Advanced Ecological Theory: Principles and Applications, vol. 100, no. 10.1002, p. 9781444311501, 1999.
- [7] M. J. Keeling, “The effects of local spatial structure on epidemiological invasions,” Proceedings of the Royal Society of London. Series B: Biological Sciences, vol. 266, no. 1421, pp. 859–867, 1999.
- [8] E. M. Volz, “SIR dynamics in random networks with heterogeneous connectivity,” Journal of Mathematical Biology, vol. 56, no. 3, pp. 293–310, 2008.
- [9] K. A. Jacobsen, M. G. Burch, J. H. Tien, and G. A. Rempała, “The large graph limit of a stochastic epidemic model on a dynamic multilayer network,” Journal of Biological Dynamics, vol. 12, no. 1, pp. 746–788, 2018.
- [10] W. R. KhudaBukhsh, B. Choi, E. Kenah, and G. A. Rempała, “Survival dynamical systems: individual-level survival analysis from population-level epidemic models,” Interface Focus, vol. 10, no. 1, p. 20190048, 2020.
- [11] L. Decreusefond, J.-S. Dhersin, P. Moyal, and V. C. Tran, “Large graph limit for an SIR process in random network with heterogeneous connectivity,” The Annals of Applied Probability, vol. 22, no. 2, pp. 541–575, 2012.
- [12] I. Z. Kiss, E. Kenah, and G. A. Rempała, “Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks,” Journal of Mathematical Biology, vol. 87, no. 2, p. 36, 2023.
- [13] G. A. Rempała and W. R. KhudaBukhsh, “Dynamical survival analysis for epidemic modeling,” in Handbook of Visual, Experimental and Computational Mathematics: Bridges through Data. Springer, 2023, pp. 1–17.
- [14] W. R. KhudaBukhsh, C. D. Bastian, M. Wascher, C. Klaus, S. Y. Sahai, M. H. Weir, E. Kenah, E. Root, J. H. Tien, and G. A. Rempała, “Projecting COVID-19 cases and hospital burden in Ohio,” Journal of Theoretical Biology, vol. 561, p. 111404, 2023. [Online]. Available: https://www.sciencedirect.com/science/article/pii/ S0022519322003952