Number of Edges in Random Intersection Graph on Surface of a Sphere

Publication date 6 September 2008

Abstract: In this article, we consider `

N

'spherical caps of area

4 p i p

were uniformly distributed over the surface of a unit sphere. We study the random intersection graph

G_{N}

constructed by these caps. We prove that for

p = f r a c c N^{a l}, : c > 0

and

a l > 2,

the number of edges in graph

G_{N}

follow the Poisson distribution. Also we derive the strong law results for the number of isolated vertices in

G_{N}

: for

p = f r a c c N^{a l}, : c > 0

for

a l < 1,

there is no isolated vertex in

G_{N}

almost surely i.e., there are atleast

N / 2

edges in

G_{N}

and for

a l > 3,

every vertex in

G_{N}

is isolated i.e., there is no edge in edge set

c E_{N} .

This page was built for publication: Number of Edges in Random Intersection Graph on Surface of a Sphere