For a multitype point pattern on a linear network, estimate the inhomogeneous multitype pair correlation function from points of type \(i\) to points of type \(j\).
linearpcfcross.inhom(X, i, j, lambdaI, lambdaJ, r=NULL, ...,
correction="Ang", normalise=TRUE,
sigma=NULL, adjust.sigma=1,
bw="nrd0", adjust.bw=1)
An object of class "fv"
(see fv.object
).
The observed point pattern,
from which an estimate of the \(i\)-to-any pair correlation function
\(g_{ij}(r)\) will be computed.
An object of class "lpp"
which
must be a multitype point pattern (a marked point pattern
whose marks are a factor).
Number or character string identifying the type (mark value)
of the points in X
from which distances are measured.
Defaults to the first level of marks(X)
.
Number or character string identifying the type (mark value)
of the points in X
to which distances are measured.
Defaults to the second level of marks(X)
.
Intensity values for the points of type i
. 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"
).
Intensity values for the points of type j
. 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"
).
numeric vector. The values of the argument \(r\) at which the function \(g_{ij}(r)\) should be evaluated. There is a sensible default. First-time users are strongly advised not to specify this argument. See below for important conditions on \(r\).
Geometry correction.
Either "none"
or "Ang"
. See Details.
Arguments passed to density.default
to control the kernel smoothing.
Logical. If TRUE
(the default), the denominator of the estimator is
data-dependent (equal to the sum of the reciprocal intensities at
the points of type i
), which reduces the sampling variability.
If FALSE
, the denominator is the length of the network.
Smoothing bandwidth passed to density.lpp
for estimation of intensities when either lambdaI
or
lambdaJ
is NULL
.
Numeric value. sigma
will be multiplied by this value.
Smoothing bandwidth (passed to density.default
)
for one-dimensional kernel smoothing of the pair correlation function.
Either a numeric value, or a character string recognised
by density.default
.
Numeric value. bw
will be multiplied by this value.
The argument i
is interpreted as a
level of the factor marks(X)
. Beware of the usual
trap with factors: numerical values are not
interpreted in the same way as character values.
Adrian Baddeley Adrian.Baddeley@curtin.edu.au
This is a counterpart of the function pcfcross.inhom
for a point pattern on a linear network (object of class "lpp"
).
The argument i
will be interpreted as
levels of the factor marks(X)
.
If i
is missing, it defaults to the first
level of the marks factor.
The argument r
is the vector of values for the
distance \(r\) at which \(g_{ij}(r)\)
should be evaluated.
The values of \(r\) must be increasing nonnegative numbers
and the maximum \(r\) value must not exceed the radius of the
largest disc contained in the window.
If lambdaI
or lambdaJ
is missing or NULL
, it will
be estimated by kernel smoothing using density.lpp
.
If lambdaI
or lambdaJ
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
.
Baddeley, A, Jammalamadaka, A. and Nair, G. (2014) Multitype point process analysis of spines on the dendrite network of a neuron. Applied Statistics (Journal of the Royal Statistical Society, Series C), 63, 673--694.
linearpcfdot
,
linearpcf
,
pcfcross.inhom
.
lam <- table(marks(chicago))/(summary(chicago)$totlength)
lamI <- function(x,y,const=lam[["assault"]]){ rep(const, length(x)) }
lamJ <- function(x,y,const=lam[["robbery"]]){ rep(const, length(x)) }
g <- linearpcfcross.inhom(chicago, "assault", "robbery", lamI, lamJ)
# using fitted models for intensity
# fit <- lppm(chicago ~marks + x)
# linearpcfcross.inhom(chicago, "assault", "robbery", fit, fit)
Run the code above in your browser using DataLab