PEarc.dens.tri {pcds} | R Documentation |
Arc density of Proportional Edge Proximity Catch Digraphs (PE-PCDs) - one triangle case
Description
Returns the arc density of PE-PCD
whose vertex set is the given 2D numerical data set, Xp
,
(some of its members are) in the triangle tri
.
PE proximity regions is defined with respect to tri
with
expansion parameter r \ge 1
and vertex regions are
based on center M=(m_1,m_2)
in Cartesian coordinates or
M=(\alpha,\beta,\gamma)
in barycentric coordinates
in the interior of the triangle tri
or based on
circumcenter of tri
; default is M=(1,1,1)
, i.e.,
the center of mass of tri
.
The function also provides arc density standardized
by the mean and asymptotic variance of the arc density
of PE-PCD for uniform data in the triangle tri
only when M
is the center of mass.
For the number of arcs, loops are not allowed.
in.tri.only
is a logical argument (default is FALSE
) for considering only the points
inside the triangle or all the points as the vertices of the digraph.
if in.tri.only=TRUE
, arc density is computed only for
the points inside the triangle (i.e., arc density of the subdigraph
induced by the vertices in the triangle is computed),
otherwise arc density of the entire digraph (i.e., digraph with all the vertices) is computed.
See also (Ceyhan (2005); Ceyhan et al. (2006)).
Usage
PEarc.dens.tri(Xp, tri, r, M = c(1, 1, 1), in.tri.only = FALSE)
Arguments
Xp |
A set of 2D points which constitute the vertices of the PE-PCD. |
tri |
A |
r |
A positive real number
which serves as the expansion parameter in PE proximity region;
must be |
M |
A 2D point in Cartesian coordinates
or a 3D point in barycentric coordinates
which serves as a center in the interior of the triangle |
in.tri.only |
A logical argument (default is |
Value
A list
with the elements
arc.dens |
Arc density of PE-PCD
whose vertices are the 2D numerical data set, |
std.arc.dens |
Arc density standardized
by the mean and asymptotic variance of the arc
density of PE-PCD for uniform data in the triangle |
Author(s)
Elvan Ceyhan
References
Ceyhan E (2005).
An Investigation of Proximity Catch Digraphs in Delaunay Tessellations, also available as technical monograph titled Proximity Catch Digraphs: Auxiliary Tools, Properties, and Applications.
Ph.D. thesis, The Johns Hopkins University, Baltimore, MD, 21218.
Ceyhan E, Priebe CE, Wierman JC (2006).
“Relative density of the random r
-factor proximity catch digraphs for testing spatial patterns of segregation and association.”
Computational Statistics & Data Analysis, 50(8), 1925-1964.
See Also
ASarc.dens.tri
, CSarc.dens.tri
,
and num.arcsPEtri
Examples
A<-c(1,1); B<-c(2,0); C<-c(1.5,2);
Tr<-rbind(A,B,C);
n<-10 #try also n<-20
set.seed(1)
Xp<-runif.tri(n,Tr)$g
M<-as.numeric(runif.tri(1,Tr)$g) #try also M<-c(1.6,1.0)
num.arcsPEtri(Xp,Tr,r=1.5,M)
PEarc.dens.tri(Xp,Tr,r=1.5,M)
PEarc.dens.tri(Xp,Tr,r=1.5,M,in.tri.only = TRUE)