Asymptotic Critical Radii in Random Geometric Graphs over 3-Dimensional Convex regions

2022/02/05 by Jie Ding, Ding, Jie, Xiaohua Xu +5 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Networking and Internet Architecture (cs.NI) #Probability (math.PR) #Stochastic processes and statistical mechanics #cs.NI #math.PR

paper · pdf · doi:10.48550/arxiv.2202.02509

arxiv created 2022/02/05 · openalex publication_date 2022/02/05 · arxiv updated 2022/02/08 · openalex created_date 2022/04/03 · openalex updated_date 2026/07/28

Abstract

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 3-Dimensional Convex region.

Cited by

• Asymptotic Critical Radii in Random Geometric Graphs over Higher-dimensional Regions

Related

• Asymptotic critical transmission radii in random geometry graphs over three-dimensional regions
• Asymptotic Critical Radii in Random Geometric Graphs over Higher-dimensional Regions
• Vertex Degree of Random Geometric Graph on Exponentially Distributed Points
• Testing thresholds for high-dimensional sparse random geometric graphs
• Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold