Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T18:12:50.632Z Has data issue: false hasContentIssue false

Compound Poisson approximation for the Johnson-Mehl model

Published online by Cambridge University Press:  14 July 2016

Torkel Erhardsson*
Affiliation:
KTH, Stockholm
*
∗ Postal address: Department of Mathematics, KTH, S-10044 Stockholm, Sweden. Email address: ter@math.kth.se

Abstract

We consider the uncovered set (i.e. the complement of the union of growing random intervals) in the one-dimensional Johnson-Mehl model. Let S(z,L) be the number of components of this set at time z > 0 which intersect (0, L]. An explicit bound is known for the total variation distance between the distribution of S(z,L) and a Poisson distribution, but due to clumping of the components the bound can be rather large. We here give a bound for the total variation distance between the distribution of S(z,L) and a simple compound Poisson distribution (a Pólya-Aeppli distribution). The bound is derived by interpreting S(z,L) as the number of visits to a ‘rare’ set by a Markov chain, and applying results on compound Poisson approximation for Markov chains by Erhardsson. It is shown that under a mild condition, if z→∞ and L→∞ in a proper fashion, then both the Pólya-Aeppli and the Poisson approximation error bounds converge to 0, but the convergence of the former is much faster.

Information

Type
Research Papers
Copyright
Copyright © 2000 by The Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable