No Arabic abstract
Amidst the current COVID-19 pandemic, quantifying the effects of strategies that mitigate the spread of infectious diseases is critical. This article presents a compartmental model that addresses the role of random viral testing, follow-up contact tracing, and subsequent isolation of infectious individuals to stabilize the spread of a disease. We propose a branching model and an individual (or agent) based model, both of which capture the stochastic, heterogeneous nature of interactions within a community. The branching model is used to derive new analytical results for the trade-offs between the different mitigation strategies, with the surprising result that a communitys resilience to disease outbreaks is independent of its underlying network structure.
Discovering and isolating infected individuals is a cornerstone of epidemic control. Because many infectious diseases spread through close contacts, contact tracing is a key tool for case discovery and control. However, although contact tracing has been performed widely, the mathematical understanding of contact tracing has not been fully established and it has not been clearly understood what determines the efficacy of contact tracing. Here, we reveal that, compared with forward tracing---tracing to whom disease spreads, backward tracing---tracing from whom disease spreads---is profoundly more effective. The effectiveness of backward tracing is due to simple but overlooked biases arising from the heterogeneity in contacts. Using simulations on both synthetic and high-resolution empirical contact datasets, we show that even at a small probability of detecting infected individuals, strategically executed contact tracing can prevent a significant fraction of further transmissions. We also show that---in terms of the number of prevented transmissions per isolation---case isolation combined with a small amount of contact tracing is more efficient than case isolation alone. By demonstrating that backward contact tracing is highly effective at discovering super-spreading events, we argue that the potential effectiveness of contact tracing has been underestimated. Therefore, there is a critical need for revisiting current contact tracing strategies so that they leverage all forms of biases. Our results also have important consequences for digital contact tracing because it will be crucial to incorporate the capability for backward and deep tracing while adhering to the privacy-preserving requirements of these new platforms.
Stochastic epidemic models on networks are inherently high-dimensional and the resulting exact models are intractable numerically even for modest network sizes. Mean-field models provide an alternative but can only capture average quantities, thus offering little or no information about variability in the outcome of the exact process. In this paper we conjecture and numerically prove that it is possible to construct PDE-limits of the exact stochastic SIS epidemics on regular and ErdH{o}s-Renyi networks. To do this we first approximate the exact stochastic process at population level by a Birth-and-Death process (BD) (with a state space of $O(N)$ rather than $O(2^N)$) whose coefficients are determined numerically from Gillespie simulations of the exact epidemic on explicit networks. We numerically demonstrate that the coefficients of the resulting BD process are density-dependent, a crucial condition for the existence of a PDE limit. Extensive numerical tests for Regular and ErdH{o}s-Renyi networks show excellent agreement between the outcome of simulations and the numerical solution of the Fokker-Planck equations. Apart from a significant reduction in dimensionality, the PDE also provides the means to derive the epidemic outbreak threshold linking network and disease dynamics parameters, albeit in an implicit way. Perhaps more importantly, it enables the formulation and numerical evaluation of likelihoods for epidemic and network inference as illustrated in a worked out example.
During a pandemic, there are conflicting demands arising from public health and economic cost. Lockdowns are a common way of containing infections, but they adversely affect the economy. We study the question of how to minimise the economic damage of a lockdown while still containing infections. Our analysis is based on the SIR model, which we analyse using a clock set by the virus. This use of the virus time permits a clean mathematical formulation of our problem. We optimise the economic cost for a fixed health cost and arrive at a strategy for navigating the pandemic. This involves adjusting the level of lockdowns in a controlled manner so as to minimise the economic cost.
We first generalise ideas discussed by Kiss et al. (2015) to prove a theorem for generating exact closures (here expressing joint probabilities in terms of their constituent marginal probabilities) for susceptible-infectious-removed (SIR) dynamics on arbitrary graphs (networks). For Poisson transmission and removal processes, this enables us to obtain a systematic reduction in the number of differential equations needed for an exact `moment closure representation of the underlying stochastic model. We define `transmission blocks as a possible extension of the block concept in graph theory and show that the order at which the exact moment closure representation is curtailed is the size of the largest transmission block. More generally, approximate closures of the hierarchy of moment equations for these dynamics are typically defined for the first and second order yielding mean-field and pairwise models respectively. It is frequently implied that, in principle, closed models can be written down at arbitrary order if only we had the time and patience to do this. However, for epidemic dynamics on networks, these higher-order models have not been defined explicitly. Here we unambiguously define hierarchies of approximate closed models that can utilise subsystem states of any order, and show how well-known models are special cases of these hierarchies.
We present a new mathematical model to explicitly capture the effects that the three restriction measures: the lockdown date and duration, social distancing and masks, and, schools and border closing, have in controlling the spread of COVID-19 infections $i(r, t)$. Before restrictions were introduced, the random spread of infections as described by the SEIR model grew exponentially. The addition of control measures introduces a mixing of order and disorder in the systems evolution which fall under a different mathematical class of models that can eventually lead to critical phenomena. A generic analytical solution is hard to obtain. We use machine learning to solve the new equations for $i(r,t)$, the infections $i$ in any region $r$ at time $t$ and derive predictions for the spread of infections over time as a function of the strength of the specific measure taken and their duration. The machine is trained in all of the COVID-19 published data for each region, county, state, and country in the world. It utilizes optimization to learn the best-fit values of the models parameters from past data in each region in the world, and it updates the predicted infections curves for any future restrictions that may be added or relaxed anywhere. We hope this interdisciplinary effort, a new mathematical model that predicts the impact of each measure in slowing down infection spread combined with the solving power of machine learning, is a useful tool in the fight against the current pandemic and potentially future ones.