A central limit theorem with applications to percolation, epidemics and Boolean models. (Q1872233)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A central limit theorem with applications to percolation, epidemics and Boolean models.
scientific article

    Statements

    A central limit theorem with applications to percolation, epidemics and Boolean models. (English)
    0 references
    0 references
    6 May 2003
    0 references
    This paper provides a central limit theorem (CLT) for a large class of stationary, set-indexed functionals \(H(X, B_n)\) defined on a family \(X= (X_z,\,z\in\mathbb{Z}^d)\) of independent identically distributed random elements taking values in some measurable space \((E,{\mathcal E})\), where \(B_n\) runs through an increasing space-filling family of sets. A stability condition is imposed on \(H(\cdot)\) in terms of the sequence increments \(\Delta_0(B_n)= H(X, B_n)- H(X',B_n)\), where \(X'\) is the process \(X\) with \(X_0\) replaced by an independent copy \(X^*\) of \(X_0\). It is assumed that \(\Delta_0(B_n)\) converges in probability to some random variable \(\Delta_0(\infty)\). Under some regularity and moment conditions the asymptotic normality of the sequence \(| B_n|^{-1/2}(H(X, B_n)- EH(X, B_n))\) is proved by employing a CLT for martingal difference arrays. This CLT is applied to component counts for percolation and Boolean models, to the size of the biggest cluster for percolation on a box, and to the final size of a spatial epidemic.
    0 references
    martingale central limit theorem
    0 references
    percolation
    0 references
    Poisson point process
    0 references
    Boolean model
    0 references
    minimal spanning tree
    0 references
    spatial epidemic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references