Perfect Simulation of the Strauss-Hardcore Process
Generate a random pattern of points, a simulated realisation of the Strauss-Hardcore process, using a perfect simulation algorithm.
rStraussHard(beta, gamma = 1, R = 0, H = 0, W = owin(), expand=TRUE, nsim=1)
- intensity parameter (a positive number).
- interaction parameter (a number between 0 and 1, inclusive).
- interaction radius (a non-negative number).
- hard core distance (a non-negative number smaller than
- window (object of class
"owin") in which to generate the random pattern. Currently this must be a rectangular window.
- Logical. If
FALSE, simulation is performed in the window
W, which must be rectangular. If
TRUE(the default), simulation is performed on a larger window, and the result is clipped to the original wind
- Number of simulated realisations to be generated.
This function generates a realisation of the
Strauss-Hardcore point process in the window
The Strauss-Hardcore process is described in
The simulation algorithm used to generate the point pattern
rmh, whose output
is only approximately correct).
A limitation of the perfect simulation algorithm
is that the interaction parameter
$\gamma$ must be less than or equal to $1$.
To simulate a Strauss-hardcore process with
$\gamma > 1$, use
There is a tiny chance that the algorithm will
run out of space before it has terminated. If this occurs, an error
message will be generated.
nsim = 1, a point pattern (object of class
nsim > 1, a list of point patterns.
Berthelsen, K.K. and