Continuous-time Markov process models of contagions are widely studied, not least because of their utility in predicting the evolution of real-world contagions and in formulating control measures. It is often the case, however, that discrete-time approaches are employed to analyze such models or to simulate them numerically. In such cases, time is discretized into uniform steps and transition rates between states are replaced by transition probabilities. In this paper, we illustrate potential limitations to this approach. We show how discretizing time leads to a restriction on the values of the model parameters that can accurately be studied. We examine numerical simulation schemes employed in the literature, showing how synchronous-type updating schemes can bias discrete-time formalisms when compared against continuous-time formalisms. Event-based simulations, such as the Gillespie algorithm, are proposed as optimal simulation schemes both in terms of replicating the continuous-time process and computational speed. Finally, we show how discretizing time can affect the value of the epidemic threshold for large values of the infection rate and the recovery rate, even if the ratio between the former and the latter is small.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7217503 | PMC |
http://dx.doi.org/10.1103/PhysRevE.94.052125 | DOI Listing |
Math Biosci Eng
December 2024
Institute of of Information Technology, Warsaw University of Life Sciences - SGGW, Nowoursynowska 159 Street, building 34, 02-776 Warsaw, Poland.
In this paper, we introduce and analyze a discrete-time model of an epidemic spread in a heterogeneous population. As the heterogeneous population, we define a population in which we have two groups which differ in a risk of getting infected: a low-risk group and a high-risk group. We construct our model without discretization of its continuous-time counterpart, which is not a common approach.
View Article and Find Full Text PDFSci Rep
January 2025
School of Electrical Engineering, VIT University, Tamilnadu, 632014, India.
Chaos
January 2025
Departamento de Física, Universidad Nacional de Colombia, Bogotá, Colombia.
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes of the network are target nodes, and we focus on the statistics of first hitting of these nodes.
View Article and Find Full Text PDFISA Trans
December 2024
College of Information Science and Engineering, Huaqiao University, Xiamen, 361002, China. Electronic address:
Iterative learning control (ILC) is a well-established method for achieving precise tracking in repetitive tasks. However, most ILC algorithms rely on a nominal plant model, making them susceptible to model mismatches. This paper introduces a novel normalization concept, developed from a frequency-domain perspective using a data-driven approach, thus eliminating the need for system model information.
View Article and Find Full Text PDFBMC Pregnancy Childbirth
December 2024
Department of Computer Science, Columbia University, 1214 Amsterdam Ave, 721 Schapiro CEPSR, New York, NY, 10027, USA.
Preeclampsia is one of the leading causes of maternal morbidity, with consequences during and after pregnancy. Because of its diverse clinical presentation, preeclampsia is an adverse pregnancy outcome that is uniquely challenging to predict and manage. In this paper, we developed racial bias-free machine learning models that predict the onset of preeclampsia with severe features or eclampsia at discrete time points in a nulliparous pregnant study cohort.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!