No Arabic abstract
Network-based interventions against epidemic spread are most powerful when the full network structure is known. However, in practice, resource constraints require decisions to be made based on partial network information. We investigated how the accuracy of network data available at individual and village levels affected network-based vaccination effectiveness. We simulated a Susceptible-Infected-Recovered process on empirical social networks from 75 villages. First, we used regression to predict the percentage of individuals ever infected based on village-level network. Second, we simulated vaccinating 10 percent of each of the 75 empirical village networks at baseline, selecting vaccinees through one of five network-based approaches: random individuals; random contacts of random individuals; random high-degree individuals; highest degree individuals; or most central individuals. The first three approaches require only sample data; the latter two require full network data. We also simulated imposing a limit on how many contacts an individual can nominate (Fixed Choice Design, FCD), which reduces the data collection burden but generates only partially observed networks. We found mean and standard deviation of the degree distribution to strongly predict cumulative incidence. In simulations, the Nomination method reduced cumulative incidence by one-sixth compared to Random vaccination; full network methods reduced infection by two-thirds. The High Degree approach had intermediate effectiveness. Surprisingly, FCD truncating individuals degrees at three was as effective as using complete networks. Using even partial network information to prioritize vaccines at either the village or individual level substantially improved epidemic outcomes. Such approaches may be feasible and effective in outbreak settings, and full ascertainment of network structure may not be required.
A mathematical model for the COVID-19 pandemic spread, which integrates age-structured Susceptible-Exposed-Infected-Recovered-Deceased dynamics with real mobile phone data accounting for the population mobility, is presented. The dynamical model adjustment is performed via Approximate Bayesian Computation. Optimal lockdown and exit strategies are determined based on nonlinear model predictive control, constrained to public-health and socio-economic factors. Through an extensive computational validation of the methodology, it is shown that it is possible to compute robust exit strategies with realistic reduced mobility values to inform public policy making, and we exemplify the applicability of the methodology using datasets from England and France. Code implementing the described experiments is available at https://github.com/OptimalLockdown.
Understanding the epidemic dynamics, and finding out efficient techniques to control it, is a challenging issue. A lot of research has been done on targeted immunization strategies, exploiting various global network topological properties. However, in practice, information about the global structure of the contact network may not be available. Therefore, immunization strategies that can deal with a limited knowledge of the network structure are required. In this paper, we propose targeted immunization strategies that require information only at the community level. Results of our investigations on the SIR epidemiological model, using a realistic synthetic benchmark with controlled community structure, show that the community structure plays an important role in the epidemic dynamics. An extensive comparative evaluation demonstrates that the proposed strategies are as efficient as the most influential global centrality based immunization strategies, despite the fact that they use a limited amount of information. Furthermore, they outperform alternative local strategies, which are agnostic about the network structure, and make decisions based on random walks.
The resurgence of measles is largely attributed to the decline in vaccine adoption and the increase in mobility. Although the vaccine for measles is readily available and highly successful, its current adoption is not adequate to prevent epidemics. Vaccine adoption is directly affected by individual vaccination decisions, and has a complex interplay with the spatial spread of disease shaped by an underlying mobility (travelling) network. In this paper, we model the travelling connectivity as a scale-free network, and investigate dependencies between the networks assortativity and the resultant epidemic and vaccination dynamics. In doing so we extend an SIR-network model with game-theoretic components, capturing the imitation dynamics under a voluntary vaccination scheme. Our results show a correlation between the epidemic dynamics and the networks assortativity, highlighting that networks with high assortativity tend to suppress epidemics under certain conditions. In highly assortative networks, the suppression is sustained producing an early convergence to equilibrium. In highly disassortative networks, however, the suppression effect diminishes over time due to scattering of non-vaccinating nodes, and frequent switching between the predominantly vaccinating and non-vaccinating phases of the dynamics.
Until a vaccine or therapy is found against the SARS-CoV-2 coronavirus, reaching herd immunity appears to be the only mid-term option. However, if the number of infected individuals decreases and eventually fades only beyond this threshold, a significant proportion of susceptible may still be infected until the epidemic is over. A containment strategy is likely the best policy in the worst case where no vaccine or therapy is found. In order to keep the number of newly infected persons to a minimum, a possible strategy is to apply strict containment measures, so that the number of susceptible individuals remains close to herd immunity. Such an action is unrealistic since containment can only last for a finite amount of time and is never total. In this article, using a classical SIR model, we determine the (partial or total) containment strategy on a given finite time interval that maximizes the number of susceptible individuals over an infinite horizon, or equivalently that minimizes the total infection burden during the curse of the epidemic. The existence and uniqueness of the optimal strategy is proved and the latter is fully characterized. If applicable in practice, such a strategy would lead theoretically to an increase by 30% of the proportion of susceptible on an infinite horizon, for a containment level corresponding to the sanitary measures put in place in France from March to May 2020. We also analyze the minimum intervention time to reach a fixed distance from herd immunity, and show the relationship with the previous problem. Simulations are provided that illustrate and validate the theoretical results.
Epidemic spread on networks is one of the most studied dynamics in network science and has important implications in real epidemic scenarios. Nonetheless, the dynamics of real epidemics and how it is affected by the underline structure of the infection channels are still not fully understood. Here we apply the SIR model and study analytically and numerically the epidemic spread on a recently developed spatial modular model imitating the structure of cities in a country. The model assumes that inside a city the infection channels connect many different locations, while the infection channels between cities are less and usually directly connect only a few nearest neighbor cities in a two-dimensional plane. We find that the model experience two epidemic transitions. The first lower threshold represents a local epidemic spread within a city but not to the entire country and the second higher threshold represents a global epidemic in the entire country. Based on our analytical solution we proposed several control strategies and how to optimize them. We also show that while control strategies can successfully control the disease, early actions are essentials to prevent the disease global spread.