Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1011.4242

Epidemics on random intersection graphs

Frank G. Ball·David J. Sirl·Pieter Trapman
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we consider a model for the spread of a stochastic SIR (Susceptible $\to$ Infectious $\to$ Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of cliques, each of random size, and infection can be transmitted between two individuals if and only if there is a clique they both belong to. Both the clique sizes and the number of cliques an individual belongs to follow mixed Poisson distributions. An infinite-type branching process approximation (with type being given by the length of an individual's infectious period) for the early stages of an epidemic is developed and made fully rigorous by proving an associated limit theorem as the population size tends to infinity. This leads to a threshold parameter $R_*$, so that in a large population an epidemic with few initial infectives can give rise to a large outbreak if and only if $R_*>1$. A functional equation for the survival probability of the approximating infinite-type branching process is determined; if $R_*\le1$, this equation has no nonzero solution, while if $R_*>1$, it is shown to have precisely one nonzero solution. A law of large numbers for the size of such a large outbreak is proved by exploiting a single-type branching process that approximates the size of the susceptibility set of a typical individual.

Explore related subjects

math.PRq-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank G. Ball, David J. Sirl, Pieter Trapman. 2014-04-28. Epidemics on random intersection graphs. https://doi.org/10.1214/13-aap942

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

KEEP EXPLORING

Related papers

arXiv2026

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR↗
arXiv2026

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR↗
arXiv2026

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR↗