StraussHardcorePointProcess
StraussHardcorePointProcess[μ,γ,rh,rs,d]
represents a Strauss hardcore point process with constant intensity μ, interaction parameter γ, hard-core interaction radius rh and Strauss interaction radius rs in .
Details
- StraussHardcorePointProcess models point configurations where the points cannot be within a hardcore radius of each other, have a constant repulsive pairwise interaction for points within between radius and of each other, and which are otherwise uniformly distributed.
- The Strauss hardcore model is typically used to model point processes like trees in a forest, where the and correspond to the trunk and canopy radius, respectively.
- The Strauss hardcore point process can be defined as a GibbsPointProcess in terms of its intensity μ and the pair potential or pair interaction , which are both parametrized by γ, rh and rs as follows:
-
pair potential pair interaction - A point configuration from a Strauss hardcore point process in an observation region reg has density function proportional to , with respect to PoissonPointProcess[1,d].
- The Papangelou conditional density for adding a point to a point configuration is .
- StraussHardcorePointProcess allows μ, γ, rh and rs to be positive numbers such that , and d to be any positive integer.
- StraussHardcorePointProcess simplifies to HardcorePointProcess when , or . Smaller values of inhibit points being closer than .
- Possible Method settings in RandomPointConfiguration for StraussPointProcess are:
-
"MCMC" Markov chain Monte Carlo birth and death "Exact" coupling from the past - Possible PointProcessEstimator settings in EstimatedPointProcess for StraussHardcorePointProcess are:
-
Automatic automatically choose the parameter estimator "MaximumPseudoLikelihood" maximize the pseudo-likelihood - StraussHardcorePointProcess can be used with such functions as RipleyK and RandomPointConfiguration.
Examples
open allclose allBasic Examples (2)
Scope (5)
Options (4)
Method (4)
Simulate using the Markov chain Monte Carlo method:
Specify the number of recursive calls to the sampler:
Provide an initial state for the simulation:
Provide an initial state for the simulation:
The initial state must have nonzero density to ensure that the result does:
Check if the minimal distance between the points is smaller than the hardcore radius:
Text
Wolfram Research (2020), StraussHardcorePointProcess, Wolfram Language function, https://reference.wolfram.com/language/ref/StraussHardcorePointProcess.html.
CMS
Wolfram Language. 2020. "StraussHardcorePointProcess." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/StraussHardcorePointProcess.html.
APA
Wolfram Language. (2020). StraussHardcorePointProcess. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/StraussHardcorePointProcess.html