Search arXivSearch

arXiv · 2108.07128

Exact solutions and bounds for network SIR and SEIR models using a rooted-tree approximation

Abstract

In this paper, we develop a node-based approximate model for Markovian contagion dynamics on networks. We prove that our approximate model is exact for SIR (susceptible-infectious-recovered) and SEIR (susceptible-exposed-infectious-recovered) dynamics on tree graphs with a single source of infection and that the model otherwise gives upper bounds on the probabilities of each node being susceptible. Our analysis of SEIR contagion dynamics is generalised to SEIR models with arbitrarily many distinct classes of exposed state. In the case of trees with a single source of infection, our approach yields a system of partially-decoupled linear differential equations that exactly describes the evolution of node-state probabilities. We use this to state explicit closed-form solutions for SIR dynamics on a chain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cameron L. Hall, Bram A. Siebert. 2021-08-16. Exact solutions and bounds for network SIR and SEIR models using a rooted-tree approximation. https://arxiv.org/abs/2108.07128

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS