Computes an estimate of the inhomogeneous linear \(K\) function based on Euclidean distances, for a point pattern on a linear network.
linearKEuclidInhom(X, lambda = NULL, r = NULL, ...,
normalise = TRUE, normpower = 2, update = TRUE,
leaveoneout = TRUE, sigma=NULL)Function value table (object of class "fv").
Point pattern on linear network (object of class "lpp").
Intensity values for the point pattern. Either a numeric vector,
a function, a pixel image
(object of class "im" or "linim") or
a fitted point process model (object of class "ppm"
or "lppm") or NULL.
Optional. Numeric vector of values of the function argument \(r\). There is a sensible default.
Ignored.
Logical. If TRUE (the default), the denominator of the estimator is
data-dependent (equal to the sum of the reciprocal intensities at the data
points, raised to normpower), which reduces the sampling variability.
If FALSE, the denominator is the length of the network.
Integer (usually either 1 or 2). Normalisation power. See Details.
Logical value indicating what to do when lambda is a fitted model
(class "lppm" or "ppm").
If update=TRUE (the default),
the model will first be refitted to the data X
(using update.lppm or update.ppm)
before the fitted intensity is computed.
If update=FALSE, the fitted intensity of the
model will be computed without re-fitting it to X.
Logical value specifying whether to use a leave-one-out rule when calculating the intensity. See Details.
Smoothing bandwidth (passed to density.lpp)
for kernel density estimation of the intensity when
lambda=NULL.
Older versions of linearKEuclidInhom interpreted
lambda=NULL to mean that the homogeneous function
linearKEuclid should be computed. This was changed to the
current behaviour in version 3.1-0 of spatstat.linnet.
Adrian Baddeley Adrian.Baddeley@curtin.edu.au.
This command computes the inhomogeneous version of the linear \(K\) function based on Euclidean distances, for a point pattern on a linear network.
This is different from the inhomogeneous \(K\) function based on
shortest-path distances,
which is computed by linearKinhom.
The inhomogeneous \(K\) function based on Euclidean distances is defined in equation (23) of Rakshit, Nair and Baddeley (2017). Estimation is performed as described in equation (28).
The argument lambda should provide estimated values
of the intensity of the point process at each point of X.
If lambda=NULL, the intensity will be estimated by kernel
smoothing by calling density.lpp with the smoothing
bandwidth sigma, and with any other relevant arguments
that might be present in .... A leave-one-out kernel estimate
will be computed if leaveoneout=TRUE.
If lambda is given, then it is expected to provide estimated values
of the intensity of the point process at each point of X.
The argument lambda may be a numeric vector (of length equal to
the number of points in X), or a function(x,y) that will be
evaluated at the points of X to yield numeric values,
or a pixel image (object of class "im") or a fitted point
process model (object of class "ppm" or "lppm").
If lambda is a fitted point process model,
the default behaviour is to update the model by re-fitting it to
the data, before computing the fitted intensity.
This can be disabled by setting update=FALSE.
The intensity at data points will be computed
by fitted.lppm or fitted.ppm.
A leave-one-out estimate will be computed if leaveoneout=TRUE
and update=TRUE.
If normalise=TRUE (the default), then the estimate
is multiplied by \(c^{\mbox{normpower}}\) where
\(
c = \mbox{length}(L)/\sum (1/\lambda(x_i)).
\)
This rescaling reduces the variability and bias of the estimate
in small samples and in cases of very strong inhomogeneity.
The default value of normpower is 1 (for consistency with
previous versions of spatstat)
but the most sensible value is 2, which would correspond to rescaling
the lambda values so that
\(
\sum (1/\lambda(x_i)) = \mbox{area}(W).
\)
Rakshit. S., Nair, G. and Baddeley, A. (2017) Second-order analysis of point patterns on a network using any distance metric. Spatial Statistics 22 (1) 129--154.
linearpcfEuclidInhom, linearKEuclid.
See linearKinhom for the corresponding function
based on shortest-path distances.
X <- rpoislpp(5, simplenet)
fit <- lppm(X ~x)
K <- linearKEuclidInhom(X, lambda=fit)
plot(K)
Run the code above in your browser using DataLab