Simulation of some spatial hard core models, and the complete packing problem

摘要: A commonly used model for spatial point patterns exhibiting inhibition between points is the hard core model, in which of pattern may be regarded as being centres non-overlapping discs fixed diameter. It often necessary statistics to able simulate many realisations various models patterns. In this paper, computer simulation two stochastic considered. The first these, Kelly-Ripley simulated using a birth and death process, while, second, “SSI” process used. each case, new method simulation, considerably faster than existing at high densities discs, described. Both algorithms use Dirichlet tessellation points. properties algorithm simulating SSI make it possible investigate random sequential packing rectangular container. An estimate limiting density complete packi...