A random walk Monte Carlo simulation study of COVID-19-like infection spread
Recent analysis of early COVID-19 data from China showed that the number of confirmed cases followed a subexponential power-law increase, with a growth exponent of around 2.2 [B.\,F.~Maier, D.~Brockmann, {\it Science} {\bf 368}, 742 (2020)]. The power-law behavior was attributed to a combination of effective containment and mitigation measures employed as well as behavioral changes by the population. In this work, we report a random walk Monte Carlo simulation study of proximity-based infection spread. Control interventions such as lockdown measures and mobility restrictions are incorporated in the simulations through a single parameter, the size of each step in the random walk process. The step size $l$ is taken to be a multiple of $\langle r \rangle$, which is the average separation between individuals. Three temporal growth regimes (quadratic, intermediate power-law and exponential) are shown to emerge naturally from our simulations. For $l = \langle r \rangle$, we get intermediate power-law growth exponents that are in general agreement with available data from China. On the other hand, we obtain a quadratic growth for smaller step sizes $l \lesssim \langle r \rangle/2 $, while for large $l$ the growth is found to be exponential. %Together with available data, these results suggest that the early containment of the disease within China was close to optimal. We further performed a comparative case study of early fatality data (under varying levels of lockdown conditions) from three other countries, India, Brazil and South Africa. We show that reasonable agreement with these data can be obtained by incorporating small-world-like connections in our simulations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Random Walk in Random Permutation Set Theory
Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Demps…
Quasi-Monte Carlo Graph Random Features
We present a novel mechanism to improve the accuracy of the recently-introduced class of graph random features (GRFs). Our method induces negative correlations between the lengths of the algorithm's random walks by impos…
Metropolis Monte Carlo sampling: convergence, localization transition and optimality
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random…
Multi-way Monte Carlo Method for Linear Systems
We study the Monte Carlo method for solving a linear system of the form $x = H x + b$. A sufficient condition for the method to work is $\| H \| < 1$, which greatly limits the usability of this method. We improve this co…
Repelling Random Walks
We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transit…