Weak laws of large numbers in geometric probability (Q1872342)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Weak laws of large numbers in geometric probability
scientific article

    Statements

    Weak laws of large numbers in geometric probability (English)
    0 references
    0 references
    0 references
    6 May 2003
    0 references
    The authors use a coupling argument to establish a general weak law of large numbers for functionals of binomial point processes in \(d\)-dimensional Euclidean space. The limit depends explicitly on the density, possibly non-uniform, of the process. When the point set forms the vertex set of a graph, functionals of interest include total edge length with arbitrary weighting, number of edges and number of components. The general result is applied to various graphs. Weak laws of large numbers are also obtained for functionals of marked point processes, including statistics of Boolean models. The methods were used previously to obtain a strong law of large numbers for functionals on uniform point sets; see e.g. the authors [Ann. Appl. Probab. 12, 272-301 (2002; Zbl 1018.60023)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weak law of large numbers
    0 references
    computational geometry
    0 references
    objective method
    0 references
    minimal spanning tree
    0 references
    nearest neighbours graph
    0 references
    Voronoi graph
    0 references
    sphere of influence graph
    0 references
    proximity graph
    0 references
    Boolean model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references