Generation of Non-Homogeneous Poisson Processes by Thinning:Programming Considerations and Comparision with Competing Algorithms.

摘要

In this thesis we study several computer implementations of the thinning algorithm, a new method for generating non-homogeneous Poisson processes. The method is valid for Poisson processes with any given intensity function. The basic thinning algorithm is modified to exploit several refinements which reduce computer execution time by approximately one-third. The basic and modified thinning programs are compared with the Poisson decomposition and gap-statistics algorithm, which is easily implemented for Poisson processes with intensity functions of the form exp(a sub 0 + a sub 1t + a sub 2 t-squared. The thinning programs are competitive in both execution time and computer memory requirements. One program implementation generates the events in a Poisson process one at a time; another program implements the algorithmic refinements which improve efficiency.