Clump Counts in a Mosaic
Hall, Peter
Ann. Probab., Tome 14 (1986) no. 4, p. 424-458 / Harvested from Project Euclid
A mosaic process is formed by centering independent and identically distributed random shapes at the points of a Poisson process in $k$-dimensional space. Clusters of overlapping shapes are called clumps. This paper provides approximations to the distribution of the number of clumps of a specified order within a large region. The approximations cover two different situations--"moderate-intensity" mosaics, in which the covered proportion of the region is neither very large nor very small; and "sparse" mosaics, in which the covered proportion is quite small. Both these mosaic types can be used to model observed phenomena, such as counts of bacterial colonies in a petri dish or dust particles on a membrane filter.
Publié le : 1986-04-14
Classification:  Clump,  geometric probability,  mosaic,  normal approximation,  Poisson approximation,  random set,  60D05,  60G55
@article{1176992525,
     author = {Hall, Peter},
     title = {Clump Counts in a Mosaic},
     journal = {Ann. Probab.},
     volume = {14},
     number = {4},
     year = {1986},
     pages = { 424-458},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176992525}
}
Hall, Peter. Clump Counts in a Mosaic. Ann. Probab., Tome 14 (1986) no. 4, pp.  424-458. http://gdmltest.u-ga.fr/item/1176992525/