We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We consider an SIR (susceptible $\to$ infective $\to$ recovered) epidemic in a closed population of size n, in which infection spreads via mixing events, comprising individuals chosen uniformly at random from the population, which occur at the points of a Poisson process. This contrasts sharply with most epidemic models, in which infection is spread purely by pairwise interaction. A sequence of epidemic processes, indexed by n, and an approximating branching process are constructed on a common probability space via embedded random walks. We show that under suitable conditions the process of infectives in the epidemic process converges almost surely to the branching process. This leads to a threshold theorem for the epidemic process, where a major outbreak is defined as one that infects at least $\log n$ individuals. We show further that there exists $\delta \gt 0$, depending on the model parameters, such that the probability that a major outbreak has size at least $\delta n$ tends to one as $n \to \infty$.
In this paper we aim to apply simple actuarial methods to build an insurance plan protecting against an epidemic risk in a population. The studied model is an extended SIR epidemic in which the removal and infection rates may depend on the number of registered removals. The costs due to the epidemic are measured through the expected epidemic size and infectivity time. The premiums received during the epidemic outbreak are measured through the expected susceptibility time. Using martingale arguments, a method by recursion is developed to calculate the cost components and the corresponding premium levels in this extended epidemic model. Some numerical examples illustrate the effect of removals and the premium calculation in an insurance plan.
We give an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex degree. As a corollary we obtain a Gumbel limit law for the extinction time, when beginning with a large population. Our contribution is to allow countably many types (this corresponds to unbounded degrees in the random graph epidemic model, as the number of vertices tends to∞). We only require a second moment for the offspring-type distribution featuring in our model.
The variable generalised stochastic epidemic model, which allows for variability in both the susceptibilities and infectivities of individuals, is analysed. A very different epidemic model which exhibits variable susceptibility and infectivity is the random-graph epidemic model. A suitable coupling of the two epidemic models is derived which enables us to show that, whilst the epidemics are very different in appearance, they have the same asymptotic final size distribution. The coupling provides a novel approach to studying random-graph epidemic models.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.