Asymptotic Critical Radii in Random Geometric Graphs over 3-Dimensional Convex regions
Abstract
This article presents the precise asymptotical distribution of two types of critical transmission radii, defined in terms of connectivity and the minimum vertex degree, for a random geometry graph distributed over a 3-Dimensional Convex region.
keywords:
Random geometry graph, Asymptotic critical radius, Convex region1 Introduction and main results
Let be a uniform -point process over a convex region , i.e., a set of independent points each of which is uniformly distributed over , and every pair of points whose Euclidean distance less than is connected with an undirected edge. So a random geometric graph is obtained.
connectivity and the smallest vertex degree are two interesting topological properties of a random geometry graph. A graph is said to be connected if there is no set of vertices whose removal would disconnect the graph. Denote by the connectivity of , being the maximum such that is connected. The minimum vertex degree of is denoted by . Let be the minimum such that is connected and be the minimum such that has the smallest degree , respectively.
When is a unit-area convex region on , the precise probability distributions of these two types of critical radii have been given in an asymptotic manner:
Theorem 1.
([1, 2]) Let be a unit-area convex region such that the length of the boundary is , be an integer and be a constant.
(i) If , let
where satisfies
(ii) If , let
Then
(1) |
and therefore, the probabilities of the two events and both converge to as .
This theorem firstly reveals how the region shape impacts on the critical transmission ranges, generalising the previous work [3, 4, 5, 6, 7] in which only regular regions like disks or squares are considered. This paper further demonstrates the asymptotic distribution of the critical radii for convex regions on :
Theorem 2.
Let be a unit-volume convex region such that the area of the boundary is , be an integer and be a constant. Let
(2) |
where solves
then the probabilities of the two events and both converge to as .
The proof of Theorem 2 follows the framework presented in [1, 2]. However, the details of the technique of boundary treatment are different. To prove Theorem 2 it suffices to prove the following four propositions. In fact, Theorem 2 is a consequence of Proposition 3 and 4. However, the proofs of Proposition 3 and 4 rely on Proposition 1 and Proposition 2 which will be proved in Section 2 and 3 respectively.
Proposition 1.
Under the assumptions of Theorem 2,
(3) |
Proposition 2.
Under the assumptions of Theorem 2,
(4) |
where is a homogeneous Poisson point process of intensity (i.e., ) distributed over unit-volume convex region .
Proposition 3.
Under the assumptions of Theorem 2,
(5) |
Proposition 4.
Under the assumptions of Theorem 2,
(6) |
We use the following notations throughout this article. (1) Region is a unit-volume convex region, and is a ball centered at with radius . (2) Notation is a short for the volume of a measurable set and represents the length of a line segment. denotes the area of a surface. (3) where is a point and is a set. (4) Given any two nonnegative functions and , if there exist two constants such that for any sufficiently large , then denote . We also use notations and to denote that and , respectively. A surface is said to be smooth in this paper, meaning that its function has continuous second derivatives.
2 Proof of Proposition 1
Throughout this article, we define
(7) |
All left work in this section is to prove Proposition 1, i.e., The proof will follow the framework proposed in [1] to carefully deal with the boundary of a convex region. The framework is developed based on the pioneering work of Wan et al. in [6] and [7], although in which only regular regions like disk or square are considered.
The following three conclusions are elementary, with their proof presented in Appendix A for reviewing.
Lemma 1.
Let be a bounded convex region, then there exists a positive constant such that for any sufficiently small , In particular, if is smooth, then , .

Lemma 2.
Suppose smooth surface is tangent to plane at point , seeing Figure 1. Point and , at point . Then
(8) |
where is a constant only depending on . This leads to that if , then as long as is sufficiently small.
For any , we define
(9) |
is usually shortly denoted by . Here this definition follows the ones in [6, 7] where only the sets on planes are considered.
Lemma 3.
Let and , then
2.1 Case of smooth
In this subsection, we assume the boundary be smooth. Let
and define Here constant is given by Lemma 2, and is considered sufficiently small so that and are disjoint. Clearly,
Claim 1.
Proof.
. Notice that .
∎
Claim 2.


For any point , let be the nearest point to , i.e., Let plane be tangent to at point , plane parallel and pass through point . Then and . See Figure 2(a). The distance between these two planes is , then by Lemma 2 we have that
which implies that ,
The distance between point and point is a continuous function of , which is due to the smooth boundary . By and , we know that any point with , or any point , is between these two planes. Define
then clearly . Here is usually shortly denoted by . Because is compact, we assume such that
Furthermore, we set
In following, we will specify in Claim 3, and then determine in Claim 4. But at first, we will establish a lower and upper bounds for where .
Because , a lower bound is straightforward:
Now we give an upper bound for . Let be the plane passing through with . Plane parallels and tangents to . See Figure 2(b). Here we assume and .
Clearly , so
and by Lemma 2, . Therefore, the volume of cylinder which is formed by surface and its projection on , satisfies
So
With that has been derived above, we obtain
According to these lower and upper bounds of , we have the following estimates:
(10) |
(11) |
Claim 3.

We define
Clearly, the subregion has boundaries and , illustrated by Figure 2. If , then by a similar argument as shown in the previous step. Clearly, . Therefore, for any . As tends to zero, both surfaces and approximate the boundary . So there exists such that the area of and , denoted by and respectively, satisfies:
where as . In addition, it is clear that is increasing along the directed line segment started from a point in to a point in . See the line segment in Figure 2.
The integration on can be bounded as follows:
(12) |
According to Lemma 3, we obtain that
Therefore,
Furthermore, noticing that for any , where is a small real number, we have that
So,
Then by formula (12),
which implies that
So, by Lemma 3, we have
Therefore, we have proved the following conclusion:
Claim 4.
The four claims prove
2.2 Case of continuous
For a general unit-volume convex region with a continuous rather than smooth boundary , we may use a family of convex regions to approximate , where the boundary of each is smooth. We set the width of the gap between and to be less than , That is, for any . Clearly, , the volume of , satisfies Because is smooth, follow the method presented in the previous subsection, we can also similarly obtain Since the volume of is no more than , then by the proof of Claim 2, we have that Therefore,
This finally completes the proof of Proposition 1.
3 Proof of Proposition 2
We follow Penrose’s approach and framework to prove Proposition 2. For given , , let
Define as follows:
where are independent Poisson variables with means respectively. As Penrose has pointed out in [5], by an argument similar to that of Section 7 of [8], to prove Proposition 2 it suffices to prove that as . Firstly, we give the following conclusion.
Proposition 5.
Under the assumptions of Theorem 2, is a Poisson variable with mean defined above, then
Proof.
The proof is shown in Appendix B. ∎
The conclusion of , as , will be proved by the following three claims.
Claim 5.
as .
Proof.
Claim 6.
, as .
Proof.
It is obvious that and are Possison variables with means and respectively. Notice that
For any , then by Lemma 1, there exists a constant such that , and thus Therefore,
The last equation holds due to Proposition 5 and the proved conclusion .
∎
Similarly, we can prove
Claim 7.
, as .
4 Proofs of Proposition 3 and 4
Proposition 2 can lead to Proposition 3 by a de-Poissonized technique. The de-Poissonized technique is standard and thus omitted here, please see [5] for details.
Here we sketch the proof of Proposition 4. Penrose has clearly proved this result when region is a square [5]. He constructed two events, and , such that for any ,
and
The definition of the events and the convergence results are organised in Proposition 5.1 and 5.2 of [5]. We do not introduce them in detail. Please refer to [5]. These conclusions can be straightly generalised to the case of convex region, with their proofs not much been modified. In fact, we have proved Proposition 1: , and in
can be bounded by where , seeing Lemma 1.
As a result, based on two generalised conclusions, a squeezing argument can lead to the following
Please see the details presented in [5].
References
References
- [1] J. Ding, et. al., Asymptotic critical transmission radii in wireless networks over a convex region, submitted to IEEE Transactions on Information Theory (first round submission with Ref. IT-18-0767) (Nov. 2018).
- [2] J. Ding, S. Ma, X. Zhu, Asymptotic critical transmission radii in wireless networks over a convex region, submitted to IEEE Transactions on Information Theory (second round submission with Ref. IT-21-0894) (Dec. 2021).
- [3] H. Dette, N. Henze, The limit distribution of the largest nearest-neighbour link in the unit -cube, Journal of Applied Probability 26 (1) (1989) 67–80.
- [4] M. D. Penrose, Random Geometric Graph, Oxford Univ. Press, 2003.
- [5] M. D. Penrose, On -connectivity for a geometric random graph, Random Struct. Algorithms 15 (1999) 145–164.
- [6] P.-J. Wan, C.-W. Yi, Asymptotic critical transmission radius and critical neighbor number for -connectivity in wireless ad hoc networks, in: Proc. the 5th ACM international symposium on Mobile ad hoc networking and computing, 2004.
- [7] P.-J. Wan, C.-W. Yi, L. Wang, Asymptotic critical transmission radius for -connectivity in wireless ad hoc networks, IEEE Transactions on Information Theory 56 (6) (2010) 2867–2874.
- [8] M. D. Penrose, The longest edge of the random minimal spanning tree, The Annals of Applied Probability 7 (2) (1997) 340–361.
Appendix A Proofs of Lemma 1, Lemma 2 and Lemma 3
The proofs of Lemma 1 and Lemma 2 are elementary and and similar to the ones presented in [1]. So they are omitted here. The following is the proof of Lemma 3.
Proof.
(i) First term:
Because , so , and
(ii) Second term. Notice that
It is easy to see that
(iii) Third term.
When ,
Then
Therefore,
∎
Appendix B Proof of Proposition 5

We first give a lemma.
Lemma 4.
The distance between the centers and of two balls which have the same radium is less than the radius, i.e., . Plane is perpendicular to line and passes through point . The semi-sphere cut by which contains point is denoted by , then the volume of (see red part in Figure 3) is
Proof.
∎
Proof.
(Proof for Proposition 5). Let then for any sufficiently large , and , let
Here , the distance between points and . Constant is an uniform upper bound given in Lemma 2. Clearly, as Figure 4(a) illustrates.


Step 1: to prove .
Step 2: to prove . For any , . Then by Lemma 2, and , see Figure 4(b). This means that at least more than one half of falling in . As a result,
where is given by Lemma 4. Therefore,
Step 3: to prove . Notice that falls in a region with the width less than , we have
Finally, we have
The proposition is therefore proved. ∎