Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0812.4353

Bounding basic characteristics of spatial epidemics with a new percolation model

Ronald Meester·Pieter Trapman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the weights of different vertices are i.i.d., but the two entries of the vector assigned to a vertex need not be independent. The probability for an edge to be open depends on the weights of its end vertices, but conditionally on the weights, the states of the edges are independent of each other. In an epidemiological setting, the vertices of a graph represent the individuals in a (social) network and the edges represent the connections in the network. The weights assigned to an individual denote its (random) infectivity and susceptibility, respectively. We show that one can bound the percolation probability and the expected size of the cluster of vertices that can be reached by an open path starting at a given vertex from above and below by the corresponding quantities for respectively independent bond and site percolation with certain densities; this generalizes a result of Kuulasmaa. Many models in the literature are special cases of our general model.

Explore related subjects

math.PRq-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ronald Meester, Pieter Trapman. 2010-03-29. Bounding basic characteristics of spatial epidemics with a new percolation model. https://arxiv.org/abs/0812.4353

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

KEEP EXPLORING

Related papers

arXiv2026

Distribution-uniform strong laws of large numbers

We revisit the question of whether the strong law of large numbers (SLLN) holds uniformly in a rich family of distributions, culminating in a distribution-uniform generalization of the Marcinkiewicz-Zygmund SLLN. These results can be viewed as extensions of Chung's distribution-uniform SLLN to random variables with uniformly integrable $q^\text{th}$ absolute central moments for $0 < q < 2$. Furthermore, we show that uniform integrability of the $q^\text{th}$ moment is both sufficient and necessary for the SLLN to hold uniformly at the Marcinkiewicz-Zygmund rate of $n^{1/q - 1}$. These proofs centrally rely on novel distribution-uniform analogues of some familiar almost sure convergence results including the Khintchine-Kolmogorov convergence theorem, Kolmogorov's three-series theorem, a stochastic generalization of Kronecker's lemma, and the Borel-Cantelli lemmas. We also consider the non-identically distributed case.

math.PR↗
arXiv2026

Malliavin Calculus for rough stochastic differential equations

In this work we show that rough stochastic differential equations (RSDEs), as introduced by Friz, Hocquet, and Lê (2021), are Malliavin differentiable. We use this to prove existence of a density when the diffusion coefficients satisfies standard ellipticity assumptions. Moreover, when the coefficients are smooth and the diffusion coefficients satisfies a Hörmander condition, the density is shown to be smooth. The key ingredient is to develop a comprehensive theory of linear rough stochastic differential equations, which could be of independent interest.

math.PR↗
arXiv2026

Nonasymptotic and distribution-uniform Komlós-Major-Tusnády approximation

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Komlós, Major, and Tusnády (KMT) [1975,1976]. The constants appearing in our inequalities are either universal or explicit, and thus as corollaries, they imply distribution-uniform generalizations of the aforementioned KMT approximations. In particular, it is shown that uniform integrability of a random variable's $q^{\text{th}}$ moment is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $o(n^{1/q})$ for $q > 2$ and that having a uniformly lower bounded Sakhanenko parameter -- equivalently, a uniformly upper-bounded Bernstein parameter -- is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $O(\log n)$. Instantiating these uniform results for a single probability space yields the analogous results of KMT exactly.

math.PR↗