Abstract—Abstract—In this article we consider N spherical caps of area 4π p were uniformly distributed over the surface of a unit sphere. We study the random intersection graph GN constructed by these caps. We prove that for p =c/Nα , c>0 and α>2 , the number of edges in graph GN follow the Poisson distribution.
Index Terms—Connectivity distance, edges, spherical caps, wireless LAN, wired LAN.
The authors are with the PDPM IIITDM Jabalpur, M.P., India (e-mail:gupta.bhupendra@gmail.com; lokendra.balyan@gmail.com).
Cite: Bhupendra Gupta and Lokendra Balyan, "Distribution of Number of Edges on Surface of a Sphere," International Journal of Machine Learning and Computing vol. 2, no. 4, pp. 431-433, 2012.