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

2025/07/16 by Jie Ding, Xiang Wei, Ding, Jie +3 · 1 citation
Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #FOS: Mathematics #Probability (math.PR) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2507.11879

openalex publication_date 2025/07/16 · openalex created_date 2025/10/14 · 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 unit-volume region Ω⊂ ℝ^d (d≥ 3).

Citations

• Asymptotic Critical Radii in Random Geometric Graphs over 3-Dimensional Convex regions
• Asymptotic Critical Transmission Radii in Wireless Networks over a Convex Region

Cited by

• Asymptotic critical transmission radii in random geometry graphs over three-dimensional regions

Related

• Asymptotic critical transmission radii in random geometry graphs over three-dimensional regions
• Asymptotic Critical Radii in Random Geometric Graphs over 3-Dimensional Convex regions
• Scaling of Components in Critical Geometric Random Graphs on 2-dim Torus
• Testing thresholds for high-dimensional sparse random geometric graphs
• Detection of L_∞ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion