Moments of $k$-hop counts in the random-connection model
Nicolas Privault

TL;DR
This paper derives moment identities for multiparameter stochastic integrals in a random-connection model, simplifying the calculation of moments for k-hop counts and advancing theoretical understanding of such models.
Contribution
It introduces new moment identities for multiparameter processes in a random-connection model, reducing complexity in deriving moments of k-hop counts.
Findings
Derived general moment identities for multiparameter processes.
Simplified the derivation of moments for k-hop counts.
Provided a unified framework for moment calculations in the model.
Abstract
We derive moment identities for the stochastic integrals of multiparameter processes in a random-connection model based on a point process admitting a Papangelou intensity. Those identities are written using sums over partitions, and they reduce to sums over non-flat partition diagrams in case the multiparameter processes vanish on diagonals. As an application, we obtain general identities for the moments of -hop counts in the random-connection model, which simplify the derivations available in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Point processes and geometric inequalities · Bayesian Methods and Mixture Models
Moments of -hop counts in the random-connection model
Nicolas Privault Division of Mathematical Sciences
School of Physical and Mathematical Sciences
Nanyang Technological University
21 Nanyang Link
Singapore 637371 [email protected]
Abstract
We derive moment identities for the stochastic integrals of multiparameter processes in a random-connection model based on a point process admitting a Papangelou intensity. Those identities are written using sums over partitions, and they reduce to sums over non-flat partition diagrams in case the multiparameter processes vanish on diagonals. As an application, we obtain general identities for the moments of -hop counts in the random-connection model, which simplify the derivations available in the literature.
Key words: Point processes, moments, random-connection model, random graph, -hops.
Mathematics Subject Classification (2010): 60G57; 60G55.
1 Introduction
The random-connection model, see e.g. Chapter 6 of [12], is a classical model in continuum percolation. It consists in a random graph built on the vertices of a point process on , by adding edges between two distinct vertices and with probability . In the case of the Rayleigh fading with , the mean value of the number of -hop paths connecting to has been computed in [9], together with the variance of -hop counts. However, this argument does not extend to as the proof of the variance identity for -hop counts in [9] relies on the known Poisson distribution of the -hop count. As shown by [9], the knowledge of moments can provide accurate numerical estimates of the probability of at least one -hop path, by expressing it as a series of factorial moments, and the need for a general theory of such moments has been pointed out therein.
On the other hand, moment identities for Poisson stochastic integrals with random integrands have been obtained in [18] based on moment identities for the Skorohod integral on the Poisson space, see [16, 17], and also [19] for a review. These moment identities have been extended to point processes with Papangelou intensities by [5], and to multiparameter processes by [2]. Factorial moments have also been computed by [4] for point processes with Papangelou intensities.
In this paper we derive closed-form expressions for the moments of the number of -hop paths in the random-connection model. In Proposition 3.1 the moment of order of the -hop count is given as a sum over non-flat partitions of in a general random-connection model based on a point process admitting a Papangelou intensity. Those results are then specialized to the case of Poisson point processes, with an expression for the variance of the -hop count given in Corollary 3.2 using a sum over integer sequences. Finally, in the case of Rayleigh fadings we show that some results of [9], such as the computation of variance for -hop counts, can be recovered via a shorter argument, see Corollary 5.3.
We proceed as follows. After presenting some background notation on point processes and Campbell measures, see [8], in Section 2 we review the derivation of moment identities for stochastic integrals using sums over partitions. In the multiparameter case we rewrite those identities for processes vanishing on diagonals, based on non-flat partition diagrams. In Section 3 we apply those results to the computation of the moments of -hop counts in the random-connection model, and we specialize such computations to the case of Poisson point processes in Section 4. Section 5 is devoted to explicit computations in the case of Rayleigh fadings, which result into simpler derivations in comparison with the current literature on moments in the random-connection model.
Notation on point processes
Let be a Polish space with Borel -algebra , equipped with a -finite non-atomic measure . We let
[TABLE]
denote the space of locally finite configurations on , whose elements are identified with the Radon point measures , where denotes the Dirac measure at . A point process is a probability measure on equipped with the -algebra generated by the topology of vague convergence.
Point processes can be characterized by their Campbell measure defined on by
[TABLE]
which satisfies the Georgii-Nguyen-Zessin [14] identity
[TABLE]
for all measurable processes such that both sides of (1.1) make sense.
In the sequel we deal with point processes whose Campbell measure is absolutely continuous with respect to , i.e.
[TABLE]
where the density is called the Papangelou density. We will also use the random measure defined on by
[TABLE]
where is the compound Campbell density defined inductively on the set of finite configurations in by
[TABLE]
see Relation (1) in [5]. In particular, the Poisson point process with intensity is a point process with Campbell measure and , and in this case the identity (1.1) becomes the Slivnyak-Mecke formula [20], [11]. Determinantal point processes are examples of point processes with Papangelou intensities, see e.g. Theorem 2.6 in [6], and they can be used for the modeling of wireless networks with repulsion, see e.g. [7], [13], [10].
2 Moment identities
The moment of order of a Poisson random variable with parameter is given by
[TABLE]
where is the number of ways to partition a set of objects into non-empty subsets, see e.g. Proposition 3.1 of [3]. Regarding Poisson stochastic integrals of deterministic integrands, in [1] the moment formula
[TABLE]
has been proved for deterministic functions .
The identity (2.2) has been rewritten in the langage of sums over partitions, and extended to Poisson stochastic integrals of random integrands in Proposition 3.1 of [18], and further extended to point processes admitting a Panpangelou intensity in Theorem 3.1 of [5], see also [4]. In the sequel, given , we will use the shorthand notation for the operator
[TABLE]
where is any random variable on . Given a partition of of size , we let denote the cardinality of each block , .
Proposition 2.1
Let be a (measurable) process. For all we have
[TABLE]
where the sum runs over all partitions of with cardinality .
Proposition 2.1 has also been extended, together with joint moment identities, to multiparameter processes , see Theorem 3.1 of [2]. For this, let denote the set of all partitions of the set
[TABLE]
identified to , and let denote the partition made of the blocks of size , for . Given a partition of , we let denote the mapping defined as
[TABLE]
, , . In other words, denotes the index of the block to which belongs.
Next, we restate Theorem 3.1 of [2] by noting that, in the same way as in Proposition 2.1, it extends to point processes admitting a Papangelou intensity using the arguments of [5], [4]. When is a multiparameter process, we will write
[TABLE]
and in this case we may drop the variable by writing instead of .
Proposition 2.2
Let be a (measurable) -process. We have
[TABLE]
with , .
Proof. The main change in the proof argument of [2] is to rewrite the proof of Lemma 2.1 therein by applying (1.2) recursively as in the proof of Theorem 3.1 of [5], while the main combinatorial argument remains identical.
When , Proposition 2.2 yields a multivariate version of the Georgii-Nguyen-Zessin identity (1.1), i.e.
[TABLE]
Non-flat partitions
In the sequel we write when a partition is finer than another partition , i.e. when every block of is contained in a block of . We also let denote the partition of made of singletons, and we write when is the only partition such that and , i.e. , , . In this case the partition diagram of of and is said to be non-flat, see Chapter 4 of [15].
A partition is non-flat if the partition diagram of of and the partition with , , is non-flat. The following figure shows an example of a non-flat partition
\pi_{1}$$\pi_{2}$$\pi_{3}$$\pi_{4}$$\pi_{5}
with , , and
[TABLE]
Processes vanishing on diagonals
The next consequence of Proposition 2.2 shows that when vanishes on the diagonals in , the moments of reduce to sums over non-flat partition diagrams.
Proposition 2.3
Assume that whenever , , . Then we have
[TABLE]
When , the first moment in Proposition 2.3 yields the Georgii-Nguyen-Zessin identity
[TABLE]
see Lemma IV.1 in [9] and Lemma 2.1 in [2] for different versions based on the Poisson point process. In the case of second moments, we find
[TABLE]
and since the non-flat partitions in are made of pairs and singletons, this identity can be rewritten as the following consequence of Proposition 2.3, in which for simplicity of notation we write and .
Corollary 2.4
Assume that whenever , , . Then the second moment of the integral of -processes is given by
[TABLE]
where the above sum is over all bijections .
Proof. We express the partitions with non-flat diagrams in Proposition 3.1 as the collections of pairs and singletons
[TABLE]
for all subsets and bijections .
In the case of -processes, Corollary 2.4 shows that
[TABLE]
Similarly, in the case of -processes we find
[TABLE]
3 Random-connection model
Two point process vertices are connected in the random-connection graph with the probability independently of , where . In particular, the -hop count is a Bernoulli random variable with parameter , and we have the relation
[TABLE]
for distinct , where means that is connected to .
Given , the number of -hop sequences of vertices connecting to in the random graph is given by the multiparameter stochastic integral
[TABLE]
of the -process
[TABLE]
which vanishes on the diagonals in , with and . In addition, for any distinct and given by (3.1) we have
[TABLE]
therefore the first order moment of the -hop count between and is given as
[TABLE]
as a consequence of the Georgii-Nguyen-Zessin identity (2.3).
In the next proposition we compute the moments of all orders of -hop counts as sums over non-flat partition diagrams. The role of the powers in (3.4) is to ensure that all powers of in (3.4) are equal to one, since all powers of in (3) below are equal to .
Proposition 3.1
The moment of order of the -hop count between and is given by
[TABLE]
where , , , , and
[TABLE]
, .
Proof. Since vanishes whenever for some , by Proposition 2.3 we have
[TABLE]
where we applied (3.2).
As in Corollary 2.4 we have the following consequence of Proposition 3.1, which is obtained by expressing the partitions with non-flat diagrams as a collection of pairs and singletons.
Corollary 3.2
The second moment of the -hop count between and is given by
[TABLE]
where the above sum is over all bijections with , , , , and
[TABLE]
[TABLE]
.
Variance of -hop counts
When and , Corollary 3.2 allows us to express the variance of the -hop count between and as follows:
[TABLE]
Variance of -hop counts
When and , Corollary 3.2 yields
[TABLE]
4 Poisson case
In this section and the next one, we work in the Poisson random-connection model, using a Poisson point process on with intensity on . We let
[TABLE]
The -hop count between and is given by the first order stochastic integral
[TABLE]
and its moment of order is
[TABLE]
therefore, from (2.1), the -hop count between and is a Poisson random variable with mean
[TABLE]
By (3.3), the first order moment of the -hop count is given by
[TABLE]
Corollary 4.1
The variance of the -hop count between and is given by
[TABLE]
with , , , and , where the above sum if over all permutations of .
Proof. We rewrite the result of Corollary 3.2 by denoting the set as , for , and we identify to , which requires a sum over the permutations of since , where . In addition, the multiple integrals over contiguous index sets in are evaluated using (4.1).
Variance of -hop counts
When and Corollary 4.1 allows us to compute the variance of the -hop count between and , as follows:
[TABLE]
Variance of -hop counts
By Corollary 4.1 we have
[TABLE]
5 Rayleigh fading
In this section we consider a Poisson point process on with flat intensity on , , and a Rayleigh fading function of the form
[TABLE]
Lemmas 5.1 and 5.2 can be used to evaluate the integrals appearing in Corollary 4.1 and in the variance (4.3) of -hop counts.
Lemma 5.1
For all , and we have
[TABLE]
Proof. We start by showing that for all we have
[TABLE]
Clearly, this relation holds for . In addition, at the rank we have
[TABLE]
Next, assuming that (5) holds at the rank , we have
[TABLE]
As a consequence, we find
[TABLE]
In particular, applying Lemma 5.1 for yields
[TABLE]
and the -hop count between and is a Poisson random variable with mean
[TABLE]
By an induction argument similar to that of Lemma 5.1, we obtain the following lemma.
Lemma 5.2
For all , and we have
[TABLE]
Proof. Clearly, the relation holds at the rank . Assuming that it holds at the rank and using (5), we have
[TABLE]
In particular, the first order moment of the -hop count between and is given by
[TABLE]
Variance of -hop counts
Corollary 4.1 and Lemma 5.2 allow us to recover Theorem II.3 of [9], for the variance of -hop counts by a shorter argument, while extending it from the plane to .
Corollary 5.3
The variance of the -hop count between and is given by
[TABLE]
Proof. By (5.3) and Lemma 5.2 we have
[TABLE]
and we conclude by (4.2).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Bassan and E. Bona. Moments of stochastic processes governed by Poisson random measures. Comment. Math. Univ. Carolin. , 31(2):337–343, 1990.
- 2[2] K. Bogdan, J. Rosiński, G. Serafin, and L. Wojciechowski. Lévy systems and moment formulas for mixed Poisson integrals. In Stochastic analysis and related topics , volume 72 of Progr. Probab. , pages 139–164. Birkhäuser/Springer, Cham, 2017.
- 3[3] K.N. Boyadzhiev. Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals. Abstr. Appl. Anal. , Art. ID 168672:18 pages, 2009.
- 4[4] J.-C. Breton and N. Privault. Factorial moments of point processes. Stochastic Processes and their Applications , 124(10):3412–3428, 2014.
- 5[5] L. Decreusefond and I. Flint. Moment formulae for general point processes. J. Funct. Anal. , 267:452–476, 2014.
- 6[6] L. Decreusefond, I. Flint, N. Privault, and G.L Torrisi. Determinantal point processes. In G. Peccati and M. Reitzner, editors, Stochastic Analysis for Poisson Point Processes: Malliavin Calculus, Wiener-Itô Chaos Expansions and Stochastic Geometry , volume 7 of Bocconi & Springer Series , pages 311–342, Berlin, 2016. Springer.
- 7[7] N. Deng, W. Zhou, and M. Haenggi. The Ginibre point process as a model for wireless networks with repulsion. IEEE Transactions on Wireless Communications , 14:107–121, 2015.
- 8[8] O. Kallenberg. Random measures . Akademie-Verlag, Berlin, fourth edition, 1986.
