Analysis reveals critical transmission radii related to k-connectivity and vertex degree in random geometric graphs, indicating their distribution over higher-dimensional regions.
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 a random geometry graph distributed over a unit-volume region Ω⊂ Rᵈ (d≥ 3).
No takes yet. Share an insight, caveat, or question.
Ding et al. (2025) studied this question.