General epidemiological models: Law of large numbers and contact tracing

Archive ouverte

Duchamps, Jean-Jil | Foutel-Rodier, Félix | Schertzer, Emmanuel

Edité par CCSD -

We study a class of individual-based, fixed-population size epidemic models under general assumptions, e.g., heterogeneous contact rates encapsulating changes in behavior and/or enforcement of control measures. We show that the large-population dynamics are deterministic and relate to the Kermack-McKendrick PDE. Our assumptions are minimalistic in the sense that the only important requirement is that the basic reproduction number of the epidemic $R_0$ be finite, and allow us to tackle both Markovian and non-Markovian dynamics. The novelty of our approach is to study the "infection graph" of the population. We show local convergence of this random graph to a Poisson (Galton-Watson) marked tree, recovering Markovian backward-in-time dynamics in the limit as we trace back the transmission chain leading to a focal infection. This effectively models the process of contact tracing in a large population. It is expressed in terms of the Doob $h$-transform of a certain renewal process encoding the time of infection along the chain. Our results provide a mathematical formulation relating a fundamental epidemiological quantity, the generation time distribution, to the successive time of infections along this transmission chain.

Suggestions

Du même auteur

Trees within trees II: Nested Fragmentations

Archive ouverte | Duchamps, Jean-Jil | CCSD

37 pages, 6 figures.. Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to the setting o...

Mutations on a random binary tree with measured boundary

Archive ouverte | Duchamps, Jean-Jil | CCSD

International audience

A large-sample theory for infinitesimal gradient boosting

Archive ouverte | Dombry, Clement | CCSD

36 pages. Infinitesimal gradient boosting is defined as the vanishing-learning-rate limit of the popular tree-based gradient boosting algorithm from machine learning (Dombry and Duchamps, 2021). It is characterized ...

Chargement des enrichissements...