Asymptotic critical transmission radii in random geometry graphs over three-dimensional regions
By: Jie Ding , Shuai Ma , Xiang Wei and more
Potential Business Impact:
Helps computers understand how networks grow.
This article presents the precise asymptotical distribution of two types of critical transmission radii, defined in terms of k-connectivity and the minimum vertex degree, for random geometry graphs distributed over three-dimensional regions.
Similar Papers
Asymptotic distribution of the global clustering coefficient in a random annulus graph
Methodology
Helps understand how groups connect in networks.
The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
Probability
Helps understand how computer networks grow.
Stochastic Geometry of Cylinders: Characterizing Inter-Nodal Distances for 3D UAV Networks
Networking and Internet Architecture
Makes wireless signals work better in 3D.