Simulation of some spatial hard core models, and the complete packing problem
DOI10.1080/00949658208810596zbMATH Open0493.05016OpenAlexW2014795994MaRDI QIDQ3955367FDOQ3955367
Authors: H. W. Lotwick 
Publication date: 1982
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949658208810596
spatial patternbirth and death processDirichlet tessellationrandom sequential packingcomplete packinghard core process
Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Combinatorial aspects of packing and covering (05B40) Statics (70C20)
Cites Work
- A note on Strauss's model for clustering
- Computing Dirichlet Tessellations in the Plane
- Title not available (Why is that?)
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Choosing the window width when estimating a density
- On random complete packing by discs
- Statistical Analysis of Spatial Point Patterns by Means of Distance Methods
- The effective sink strength of a random array of voids in irradiated material
- On the Distribution of Randomly Placed Discs
Cited In (8)
- Geometrically corrected second order analysis of events on a linear network, with applications to ecology and criminology
- Statistics, images, and pattern recognition
- Grid methods in simulation and random variate generation
- Correction to Koen's critical values in testing spatial randomness
- Random sequential adsorption of discs on surfaces of constant curvature: plane, sphere, hyperboloid, and projective plane
- Multitype Spatial Point Patterns with Hierarchical Interactions
- Testing local independence between two point processes
- Maximum likelihood estimation for random sequential adsorption
This page was built for publication: Simulation of some spatial hard core models, and the complete packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955367)
