Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/30440
Title: | Algorithmic Approach for a Unique Definition of the Next-Generation Matrix | Authors: | Avram, Florin Adenane, Rim Basnarkov, Lasko Johnston, Matthew D |
Keywords: | deterministic epidemic model; disease-free equilibrium; stability threshold; basic reproduction number; (F, V) gradient decomposition; next-generation matrix; Jacobian approach; CTMC stochastic model associated to a deterministic epidemic model; probability of extinction; rational univariate representation | Issue Date: | 21-Dec-2023 | Publisher: | MDPI | Journal: | Mathematics | Abstract: | The basic reproduction number ๐ 0 is a concept which originated in population dynamics, mathematical epidemiology, and ecology and is closely related to the mean number of children in branching processes (reflecting the fact that the phenomena of interest are well approximated via branching processes, at their inception). Despite the very extensive literature around ๐ 0 for deterministic epidemic models, we believe there are still aspects which are not fully understood. Foremost is the fact that ๐ 0 is not a function of the original ODE model, unless we also include in it a certain (๐น,๐) gradient decomposition, which is not unique. This is related to the specification of the โinfected compartmentsโ, which is also not unique. A second interesting question is whether the extinction probabilities of the natural continuous time Markovian chain approximation of an ODE model around boundary points (disease-free equilibrium and invasion points) are also related to the (๐น,๐) gradient decomposition. We offer below several new contributions to the literature: (1) A universal algorithmic definition of a (๐น,๐) gradient decomposition (and hence of the resulting ๐ 0). (2) A fixed point equation for the extinction probabilities of a stochastic model associated to a deterministic ODE model, which may be expressed in terms of the (๐น,๐) decomposition. Last but not least, we offer Mathematica scripts and implement them for a large variety of examples, which illustrate that our recipe offers always reasonable results, but that sometimes other reasonable (๐น,๐) decompositions are available as well. | URI: | http://hdl.handle.net/20.500.12188/30440 |
Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.