num.arcsCSend.int: Number of arcs of Central Similarity Proximity Catch Digraphs...

In elvanceyhan/pcds: Proximity Catch Digraphs and Their Applications

Number of arcs of Central Similarity Proximity Catch Digraphs (CS-PCDs) - end interval case

Description

Returns the number of arcs of Central Similarity Proximity Catch Digraphs (CS-PCDs) whose vertices are a 1D numerical data set, Xp, outside the interval int=(a,b).

CS proximity region is constructed only with expansion parameter t>0 for points outside the interval (a,b).

End vertex regions are based on the end points of the interval, i.e., the corresponding end vertex region is an interval as (-\infty,a) or (b,\infty) for the interval (a,b). For the number of arcs, loops are not allowed, so arcs are only possible for points outside the interval, int, for this function.

See also (\insertCiteceyhan:revstat-2016;textualpcds).

Usage

num.arcsCSend.int(Xp, int, t)

Arguments

Xp	A vector of 1D points which constitute the vertices of the digraph.
int	A vector of two real numbers representing an interval.
t	A positive real number which serves as the expansion parameter in CS proximity region.

Value

Number of arcs for the CS-PCD with vertices being 1D data set, Xp, expansion parameter, t, for the end intervals.

Author(s)

Elvan Ceyhan

References

\insertAllCited

See Also

num.arcsCSmid.int, num.arcsPEmid.int, and num.arcsPEend.int

Examples

a<-0; b<-10; int<-c(a,b)

n<-5
XpL<-runif(n,a-5,a)
XpR<-runif(n,b,b+5)
Xp<-c(XpL,XpR)

num.arcsCSend.int(Xp,int,t=2)

num.arcsCSend.int(Xp,int,t=1.2)

num.arcsCSend.int(Xp,int,t=4)

num.arcsCSend.int(Xp,int,t=2+5)
#num.arcsCSend.int(Xp,int,t=c(-5,15))

n<-10  #try also n<-20
Xp2<-runif(n,a-5,b+5)
num.arcsCSend.int(Xp2,int,t=2)

t<-.5
num.arcsCSend.int(Xp,int,t)

elvanceyhan/pcds documentation built on June 29, 2023, 8:12 a.m.