Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinal size and convergence rate for an epidemic in heterogeneous population
105
0
0.0
(
0
)
Authors
Luis Almeida
Ask ChatGPT about the research
No Arabic abstract
We formulate a general SEIR epidemic model in a heterogenous population characterized by some trait in a discrete or continuous subset of a space R d. The incubation and recovery rates governing the evolution of each homogenous subpopulation depend upon this trait, and no restriction is assumed on the contact matrix that defines the probability for an individual of a given trait to be infected by an individual with another trait. Our goal is to derive and study the final size equation fulfilled by the limit distribution of the population. We show that this limit exists and satisfies the final size equation. The main contribution is to prove the uniqueness of this solution among the distributions smaller than the initial condition. We also establish that the dominant eigenvalue of the next-generation operator (whose initial value is equal to the basic reproduction number) decreases along every trajectory until a limit smaller than 1. The results are shown to remain valid in presence of diffusion term. They generalize previous works corresponding to finite number of traits (including metapopulation models) or to rank 1 contact matrix (modeling e.g. susceptibility or infectivity presenting heterogeneity independently of one another).
rate research
Read More
We develop a new methodology for the efficient computation of epidemic final size distributions for a broad class of Markovian models. We exploit a particular representation of the stochastic epidemic process to derive a method which is both computationally efficient and numerically stable. The algorithms we present are also physically transparent and so allow us to extend this method from the basic SIR model to a model with a phase-type infectious period and another with waning immunity. The underlying theory is applicable to many Markovian models where we wish to efficiently calculate hitting probabilities.
In this article, we give an in-depth analysis of the problem of optimising the total population size for a standard logistic-diffusive model. This optimisation problem stems from the study of spatial ecology and amounts to the following question: assuming a species evolves in a domain, what is the best way to spread resources in order to ensure a maximal population size at equilibrium? {In recent years, many authors contributed to this topic.} We settle here the proof of two fundamental properties of optimisers: the bang-bang one which had so far only been proved under several strong assumptions, and the other one is the fragmentation of maximisers. Here, we prove the bang-bang property in all generality using a new spectral method. The technique introduced to demonstrate the bang-bang character of optimizers can be adapted and generalized to many optimization problems with other classes of bilinear optimal control problems where the state equation is semilinear and elliptic. We comment on it in a conclusion section.Regarding the geometry of maximisers, we exhibit a blow-up rate for the $BV$-norm of maximisers as the diffusivity gets smaller: if $O$ is an orthotope and if $m_mu$ is an optimal control, then $Vert m_muVert_{BV}gtrsim sqrt{mu}$. The proof of this results relies on a very fine energy argument.
Given maximal social distancing duration and intensity, how can one minimize the epidemic final size, or equivalently the total number of individuals infected during the outbreak? A complete answer to this question is provided and demonstrated here for the SIR epidemic model. In this simplified setting, the optimal solution consists in enforcing the highest confinement level during the longest allowed period, beginning at a time instant that is the unique solution to certain 1D optimization problem. Based on this result, we present numerical results showing the best possible performance for a large set of basic reproduction numbers and lockdown durations and intensities.
The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of allocating recovery resources among the population, at the lowest cost possible to prevent the epidemic from persisting indefinitely in the network. Specifically, we analyze a susceptible-infected-susceptible epidemic process spreading over a weighted graph, by means of a first-order mean-field approximation. First, we describe the influence of the contact network on the dynamics of the epidemics among a heterogeneous population, that is possibly divided into communities. For the case of a community network, our investigation relies on the graph-theoretical notion of equitable partition; we show that the epidemic threshold, a key measure of the network robustness against epidemic spreading, can be determined using a lower-dimensional dynamical system. Exploiting the computation of the epidemic threshold, we determine a cost-optimal curing policy by solving a convex minimization problem, which possesses a reduced dimension in the case of a community network. Lastly, we consider a two-level optimal curing problem, for which an algorithm is designed with a polynomial time complexity in the network size.
Given a strictly hyperbolic, genuinely nonlinear system of conservation laws, we prove the a priori bound $big|u(t,cdot)-u^ve(t,cdot)big|_{L^1}= O(1)(1+t)cdot sqrtve|lnve|$ on the distance between an exact BV solution $u$ and a viscous approximation $u^ve$, letting the viscosity coefficient $veto 0$. In the proof, starting from $u$ we construct an approximation of the viscous solution $u^ve$ by taking a mollification $u*phi_{strut sqrtve}$ and inserting viscous shock profiles at the locations of finitely many large shocks, for each fixed $ve$. Error estimates are then obtained by introducing new Lyapunov functionals which control shock interactions, interactions between waves of different families and by using sharp decay estimates for positive nonlinear waves.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
