Concentration inequalities for measures of a Boolean model
G\"unter Last, Fabian Gieringer

TL;DR
This paper derives concentration inequalities for measures of a Boolean model driven by a Poisson process, providing probabilistic bounds on the measure of the union of overlapping particles in a metric space.
Contribution
It introduces new concentration inequalities for functionals of Poisson processes, specifically applied to measures of Boolean models with overlapping particles.
Findings
Established concentration inequalities for ho(Z) in Boolean models.
Provided general Poisson process concentration inequalities applicable to various phase spaces.
Enhanced understanding of probabilistic bounds for geometric random sets.
Abstract
We consider a Boolean model driven by a Poisson particle process on a metric space . We study the random variable , where is a (deterministic) measure on . Due to the interaction of overlapping particles, the distribution of cannot be described explicitly. In this note we derive concentration inequalities for . To this end we first prove two concentration inequalities for functions of a Poisson process on a general phase space.
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
TopicsBayesian Methods and Mixture Models · Point processes and geometric inequalities · Stochastic processes and statistical mechanics
Concentration inequalities
for measures of a Boolean model
Fabian [email protected], [email protected], Karlsruhe Institute of Technology, Institute of Stochastics, 76128 Karlsruhe, Germany. and Günter Last11footnotemark: 1
Abstract
We consider a Boolean model driven by a Poisson particle process on a metric space . We study the random variable , where is a (deterministic) measure on . Due to the interaction of overlapping particles, the distribution of cannot be described explicitly. In this note we derive concentration inequalities for . To this end we first prove two concentration inequalities for functions of a Poisson process on a general phase space.
2000 Mathematics Subject Classification. 60D05, 60G55.
Key words and phrases. concentration inequality, Poisson process, Boolean model, covariance identity
1 Introduction
Let be a locally compact separable metric space and let be the space of all closed subsets of equipped with a suitable -field. Let be a Poisson process on with a -finite intensity measure . If , then we write and say that is a particle of . The Boolean model associated with is the random set defined by the union of all particles, that is
[TABLE]
Let be a measure on satisfying
[TABLE]
Then is a finite random variable even though might not be a random closed set in the sense of [15, 18].
The random set is a fundamental model of stochastic geometry and continuum percolation; see [5, 15, 18]. Explicit formulae for the distribution of geometric functionals of the Boolean model are not available, even not in the simplest case of a stationary Boolean on and being the restriction of Lebesgue measure to a convex and compact set . The reason for the absence of such formulae is the interaction between the particles from caused by overlapping. One way out are moment formulae and central limit theorems; see e.g. [10] and [13, Chapter 22]. In this paper we will prove concentration inequalities of the form
[TABLE]
where the function is determined by and . In the stationary Euclidean case such inequalities were first proved in [7]. Our bounds improve these results. Moreover, we generalize the setting of [7] in several ways. First, we study the Boolean model on a metric space and not only on . Second, we will allow that compact subsets of are intersected by infinitely many Poisson particles. Hence, in general, the random set is not closed and its boundary might have fractal properties. Roughly speaking, this means that we can allow for a -finite distribution of the typical grain. Closely related models of this type were introduced in [21], a seminal paper on fractal percolation, that was almost completely ignored in the later literature. Third, we consider general measures and not only the volume. Finally, our method allows to treat also Lipschitz functions of these measures.
Similarly as in [8, 9] our approach is based on a covariance identity for square integrable Poisson functionals. In fact we first prove a concentration inequality for functions of a Poisson process on a general phase space. Using the log-Sobolev inequality, related concentration inequalities were derived in [2, 1, 19].
2 Concentration of Poisson functionals
Let be a measurable space and let be a -finite measure on . Let be a Poisson process on with intensity measure , defined over a probability space ; see [13]. In particular, is a point process, that is a measurable mapping from to the space of all -finite measures with values in , where is equipped with the smallest -field such that is measurable for all . The distribution of is denoted by . Since we are only interested in distributional properties of , Corollary 6.5 in [13] shows that it is no restriction of generality to assume that is proper. This means that there exist random elements in and an -valued random variable such that almost surely .
Let and be a sequence of independent random variables with distribution , independent of . Define as the -thinning of . Then and are independent Poisson processes with intensity measures and , respectively. Given and a measurable function , the difference operator is defined by
[TABLE]
This mapping is measurable since is measurable. We call a random variable a Poisson functional if there is a measurable such that almost surely. In this case we define
[TABLE]
(which is almost surely, for -almost all , independent of the choice of an admissible ) and further a mapping , given by .
The starting point of our concentration inequalities is the following covariance identity; see Theorem 20.2 in [13]. The conditional expectation appearing there can be dropped such that we get the following identity.
Proposition 2.1**.**
Let and be Poisson functionals such that and . Then
[TABLE]
For we define
[TABLE]
where the case is possible. Define
[TABLE]
The following bound for the cumulant-generating function is the main result of this section.
Theorem 2.2**.**
Let and . Then
[TABLE]
Proof.
We combine the idea of the proof of Lemma 3.1 in [9] (see also the proof of Theorem 1 in [8]) with Lemma 11 in Massart [14]. Let and be such that \mathbb{E}\big{[}e^{sV_{F}(u)/\theta}\big{]}<\infty and let . Since , we can use the covariance identity (2.1) to obtain that
[TABLE]
Now, Lemma 11 of Massart [14] applied to and yields
[TABLE]
The combination of the last two displays leads to the inequality
[TABLE]
and a simple rearrangement yields
[TABLE]
Setting h(t):=\log\mathbb{E}\big{[}e^{tF}\big{]} and g_{u}(t):=\log\mathbb{E}\big{[}e^{tV_{F}(u)}\big{]}, , we have
[TABLE]
By and the convexity of , we have for , thus
[TABLE]
From \log\mathbb{E}\big{[}e^{s(F-\mathbb{E}[F])}\big{]}=h(s)-s\hskip 1.0pt\mathbb{E}[F] and the preceding inequality, (2.2) follows. Using Jensen’s inequality, this simplifies to (2.3). ∎
Theorem 2.2 and the well-known Chernoff bound (see [4])
[TABLE]
(a direct consequence of Markov’s inequality) imply a concentration inequality. If has a deterministic bound, this inequality can be simplified as follows.
Corollary 2.3**.**
Let and assume that is a measurable function such that almost surely for each . Then,
[TABLE]
Proof.
Let and . By the Chernoff bound (2.4), inequality (2.3) and assumption , we get
[TABLE]
We have since the contrary would lead to which is obviously wrong. Since , we obtain that
[TABLE]
and hence the assertion. ∎
Remark 2.4**.**
Concentration inequalities for the lower tail can be derived analogously. Under the obvious integrability assumptions, the bounds (2.2) and (2.3) hold again upon replacing by and by . Thus, by the Chernoff bound , , a result analogous to Corollary 2.3 gives a bound for the lower tail when has a deterministic bound. Hence, all results relying on Corollary 2.3 can be given for the lower tail as well.
Our next result was motivated by a question in [1] whether the Mecke formula (cf. [13]) can be combined with the covariance identity to yield reasonable concentration inequalities.
Theorem 2.5**.**
Let be such that holds -almost everywhere. Assume further that there exist a measurable function and constants and such that a.s.
[TABLE]
and
[TABLE]
Then
[TABLE]
In particular, if , we have
[TABLE]
Proof.
Let . By the covariance identity (2.1) and assumption (2.6), we have
[TABLE]
Applying the Mecke formula and the elementary bound , , yields
[TABLE]
Assumption (2.7) yields that \mathrm{Cov}\big{(}F,e^{uF}\big{)}\leq ua\hskip 1.0pt\mathbb{E}\big{[}F\hskip 1.0pte^{uF}\big{]}+ub\hskip 1.0pt\mathbb{E}\big{[}e^{uF}\big{]}. By a rearrangement, we obtain
[TABLE]
Setting , we get and consequently, by integration and , the bound . Using the Chernoff bound (2.4), we obtain (2.8). The second assertion (2.9) then follows by optimising with . This choice of is at most , since a.s. by assumption (2.7), and the case can be ruled out as this implies and therefore a trivial concentration. ∎
3 General Boolean models
In this section we consider a locally compact separable Hausdorff space together with the Borel -field . Let denote the class of closed subsets of equipped with the Fell topology generated by the sets and for arbitrary compact sets and open sets ; see [15, 18]. The associated Borel -field is denoted by .
Let be a measure on and let be such that is finite on and is measurable on . We also assume that is closed under (finite) unions and equip with the trace -field .
Let be a -finite intensity measure on satisfying
[TABLE]
Let be such that and for all . Let denote the measurable set of all satisfying for each . Note that . Define
[TABLE]
and for . The random set is called the Boolean model governed by . Now consider the function given by
[TABLE]
with the convention . Our goal is to obtain a concentration inequality for
[TABLE]
Campbell’s formula (Proposition 2.7 in [13]) and assumption (3.1) show that a.s., so that the sub-additivity of shows that a.s. In particular . However, we need to check that is a random variable. This follows from the assumption on and the next lemma.
Lemma 3.1**.**
The mapping is measurable on . Furthermore, for each with , the mapping is measurable on . Finally is measurable on .
Proof.
By Theorem 1-2-1 in [15], is a compact and separable Hausdorff space and hence (equipped with the trace -field) is a Borel space. By [13, Proposition 6.2] (see also the proof of [13, Proposition 6.3]), there exist measurable functions such that
[TABLE]
This shows that for each . By [15, Theorem 2-5-1], the mapping is measurable on . Since
[TABLE]
this proves the first assertion. The second assertion follows from Fubini’s theorem.
By monotone convergence, the third assertion follows, once we have shown that
[TABLE]
is measurable for each . By [15, Corollary 1-2-1] the mapping is measurable on and hence also on . Since is closed under unions, it follows that is a measurable mapping from to . Since is measurable on , the final assertion now follows. ∎
Let . We now compute the probability that a point lies inside the Boolean model of intensity measure . We use the notation
[TABLE]
Since is -measurable, this is a measurable set. The first definition in (3.2) and the defining properties of a Poisson process yield
[TABLE]
Lemma 3.2**.**
We have that
[TABLE]
Proof.
For each and each we have that
[TABLE]
Since we can use the additivity of to conclude the proof. ∎
Lemma 3.3**.**
Let and . Then -a.s.
[TABLE]
Proof.
It follows from Lemma 3.2 and the superposition theorem for Poisson processes that -a.s.
[TABLE]
Furthermore,
[TABLE]
where we have used (3.4). The assertion now follows. ∎
Define
[TABLE]
where is given by for , and . We define a measure on by
[TABLE]
with the convention and another measure on by
[TABLE]
Naturally, our concentration inequalities require the constant
[TABLE]
to be positive.
The function , defined by , plays an important role in the sequel.
Theorem 3.4**.**
Assume that (3.1) holds and that , where is given by (3.6). Then the Poisson functional satisfies
[TABLE]
Proof.
We write . Let . Then is a Poisson process with intensity measure . Define and . We wish to apply Corollary 2.3 to the pair . We start by checking the integrability properties of the Poisson functional . First, we obtain from Lemma 3.2 that
[TABLE]
which is finite by (3.1). Since the Poincaré inequality (see [13, Exercise 18.2]) shows that . Secondly, we have for each that
[TABLE]
where we have used a well-known formula for Poisson processes (see e.g. [13]). The integral in the exponent is dominated by a multiple (depending on and ) of and hence finite. Thirdly, we have
[TABLE]
This is finite, since \int\mathbf{1}\{u\leq n\}\big{(}e^{su}-1\big{)}^{2}\,\nu(du) is bounded by a multiple of .
By Lemma 3.2 and Lemma 3.3 (applied with in place of ),
[TABLE]
Let \rho^{*}_{n}(K):=\int_{K}\tau\big{(}\Lambda_{n}\big{(}\mathcal{F}^{\prime}_{y}\big{)}\big{)}\,\rho(dy). Then we have
[TABLE]
For each we now obtain from (2.5) that
[TABLE]
As we have and hence . Monotone convergence implies . We now assume that and assert that
[TABLE]
Indeed, we have for each that , and since we obtain for each from dominated convergence that . Hence (3.9) follows from dominated convergence once we have shown that is finite. By assumption (3.6) it is sufficient to show that
[TABLE]
For the definition of implies that and (3.10) follows. Let such that . Fatou’s Lemma shows that
[TABLE]
where we have used (3.9) and (3.8) to obtain the second inequality. Letting , we obtain the asserted concentration inequality (3.7). ∎
Theorem 3.4 can be generalized to Lipschitz functions of . Recall that a function is Lipschitz with Lipschitz constant if for all .
Theorem 3.5**.**
Let the assumptions of Theorem 3.4 be satisfied and let be a Lipschitz function with Lipschitz constant . Then the Poisson functional satisfies
[TABLE]
Proof.
We generalize the proof of Theorem 3.4. Let , . We first note that
[TABLE]
Since , we can use the first part of the above proof to conclude that the pair satisfies the assumptions of Corollary 2.3 with in place of . Using (3.11) and the inequality , , we now obtain for all that
[TABLE]
Since
[TABLE]
we can finish the proof as before. ∎
In the remainder of the paper we shall work with Theorem 3.4 and not with its more general version. However, all results can be formulated for Lipschitz functions of .
Define a function by
[TABLE]
If , then . Otherwise is finite and strictly increasing on . Let denote the generalized inverse of , defined by
[TABLE]
where . If , then on . Otherwise is strictly increasing and continuous on , where .
Theorem 3.6**.**
Under the assumptions of Theorem 3.4,
[TABLE]
Proof.
If , then and the result is trivial. Hence we can assume that . We next show that then . By definition of it is sufficient to show for each that whenever . Since on , it is sufficient to prove that for -a.e. . But this follows from
[TABLE]
which is finite by (3.1).
Since we obtain for each that
[TABLE]
In view of Theorem 3.4 the proof can now be finished as that of [8, Theorem 1]. ∎
Remark 3.7**.**
Proposition 3.2 in [19] implies (3.7) with instead of . Since , our result improves this inequality. The larger the larger the improvement. Recall from (3.4) that \mathbb{P}(y\in Z)=1-\exp\big{(}-\Lambda\big{(}\mathcal{F}^{\prime}_{y}\big{)}\big{)} is the probability that the point is covered by . Our concentration inequality takes into account these covering probabilities and hence the overlapping of distinct grains.
In the sequel we use the function , defined by
[TABLE]
and . We also define
[TABLE]
The proof of the following corollary of Theorem 3.6 is similiar to that of [8, Corollary 1].
Corollary 3.8**.**
Assume that (3.1) holds and that . Assume also that there is some such that for -a.e. . Then we have for each that
[TABLE]
Proof.
We first note that . This follows by once we have shown that . To this end, let . Then, we have which is finite by (3.1).
Let . In the case we can assume that . (Otherwise there is nothing to prove.) It is easy to see that for all ; cf. the proof of [8, Corollary 1] for the case . Therefore
[TABLE]
Since
[TABLE]
for each , we deduce the assertion from Theorem 3.6. ∎
Example 3.9**.**
In this example we specialize the setting of this section to the case for some fixed integer . We set . We fix and let denote the -dimensional Hausdorff measure on . Let denote the set of all such that is a locally finite measure on . By [20, Corollary 2.1.5], this is a measurable set, that is . Let be a compact set and define . By [20, Theorem 2.1.3], we have that is measurable on , so that the pair satisfies the general assumptions of this section (with ).
4 Stationary Boolean models
In this section we consider the setting of Example 3.9 in the case . We let be a Poisson process on the space of all closed sets with . We assume here that the intensity measure of is of the translation invariant form
[TABLE]
where and is a -finite measure on satisfying
[TABLE]
Example 4.1**.**
Let be a probability measure on satisfying and let be a measure on such that . Assume that
[TABLE]
Then
[TABLE]
We fix a closed set with positive finite volume and derive concentration inequalities for the Poisson functional
[TABLE]
where , , is given by (3.2) and the -finiteness of will be checked below. We do this by applying the results of the previous section in the case . Let
[TABLE]
By (3.4), we have . Moreover, Fubini’s theorem and (4.3) below imply that
[TABLE]
so that is the volume fraction of .
Theorem 4.2**.**
Assume that (4.2) holds. Then the Poisson functional satisfies
[TABLE]
Proof.
We wish to apply Theorem 3.4 in the case .
Set and and let be a Poisson process with intensity measure . Then has the same distribution as . Hence we can assume without loss of generality that for -a.e. . In particular is then -finite.
For each Borel set we have that
[TABLE]
By Fubini’s theorem and (4.1) we obtain that
[TABLE]
so that (4.2) implies assumption (3.1).
Let . Then
[TABLE]
Therefore we have , where is given by (3.6).
As at (3.3) we define for . From (4.1) we obtain that
[TABLE]
Hence \tau\big{(}\Lambda\big{(}\mathcal{F}^{d}_{x}\big{)}\big{)}=p/\gamma_{1}. Therefore the measure defined by (3.5) is given by
[TABLE]
Hence Theorem 3.4 implies the assertion. ∎
The right-hand side of the concentration inequality provided by Theorem 4.2 is of a rather complicated form. In the sequel we shall derive more explicit versions. We use the function defined by (3.13) and the constant
[TABLE]
Corollary 4.3**.**
Assume that (4.2) holds and that is such that for -a.e. . Then satisfies
[TABLE]
Proof.
We can apply Corollary 3.8. Using (4.4) and (4.1) we obtain that
[TABLE]
Inequality (4.5) now follows from the case of Corollary 3.8.
Similarly we obtain that
[TABLE]
Since is decreasing, the inequality (4.6) follows from the case of Corollary 3.8. ∎
Remark 4.4**.**
Suppose there exists such that for -a.e. . Then (4.6) is superior to (4.5). If there exist and with such that , then both inequalities yield
[TABLE]
Remark 4.5**.**
The estimate (4.7) is quite sharp. This can be seen by a comparison with the concentration of a Poisson distributed random variable . Lemma 1.2 in [16] provides the bound \mathbb{P}(X-\mathbb{E}[X]\geq r)\leq\exp\big{(}r\cdot\psi(r/\mathbb{E}[X])\big{)}, . Furthermore, only a slight modification of the last bound leads to the exact asymptotic \mathbb{P}(X-\mathbb{E}[X]\geq r)\sim(2\pi(\mathbb{E}[X]+r))^{-1/2}\exp\big{(}r\cdot\psi(r/\mathbb{E}[X])\big{)}, as , see page 1225 in [8].
Remark 4.6**.**
Choosing in (4.5) yields
[TABLE]
The advantage of this result is that it holds under the only assumption (4.2). The disadvantage is the occurence of as a factor of outside the logarithmic term. This is in contrast with the situation in Remark 4.4.
If is not essentially bounded w.r.t. , we need an exponential moment assumption on to improve (4.8) at least partially. Define a function by
[TABLE]
Corollary 4.7**.**
Assume that (4.2) holds. Then the Poisson functional satisfies
[TABLE]
Proof.
We wish to apply Theorem 3.6. Recall the definition (3.12) of the function . By (4.4) we have for each that
[TABLE]
Hence we have for each that , so that Theorem 3.6 and the identity imply the assertion once we have shown that . But this follows from (a consequence of ). ∎
We illustrate Corollary 4.7 with two examples. Let .
Example 4.8**.**
Assume that , where . On the right-hand side we have here the Lévy measure of the gamma distribution with shape parameter and rate parameter ; see e.g. [13, Example 15.6]. For instance, this assumption is satisfied with if , where has . Let . A simple calculation shows that , so that
[TABLE]
It follows that
[TABLE]
Therefore we obtain from Corollary 4.7
[TABLE]
Example 4.9**.**
Assume that , where . On the right-hand side we have here the gamma distribution with shape parameter and scale parameter . A similar calculation as in Example 4.8, yields for , so that
[TABLE]
and finally, by Corollary 4.7,
[TABLE]
Remark 4.10**.**
Examples 4.8 and 4.9 are geometrically quite different. Assume in the second example that . Then each bounded set contains a finite number of grain centers (at least under a weak regularity assumption on ). Ignoring overlapping, each grain contributes a gamma distributed volume. Assume in the first example that . Then each measurable set with contains infinitely many grain centers. However, the sum of the volumes of balls centered in follows a gamma distribution with scale parameter and shape parameter ; see [13, Example 15.6]. Roughly speaking, might be interpreted as a finite union of random sets whose volumes are approximately gamma distributed. This might explain that the leading terms in both concentration inequalities are the same.
Our bounds of Corollary 4.3 improve significantly Theorem 3 in [7] which deals with the stationary Boolean model in and which assumes to be a probability measure. The tail bound in [7] is only of order \exp\big{(}-\mathcal{O}(r)\big{)} and therefore not able to reproduce the tail behaviour of the Poisson distribution in the special setting of Remark 4.4. Further, the constants we use arise naturally from the model and are much less involved than the ones in [7]. Moreover, we do not require that the moment-generating function of exists but only make the milder moment assumptions , respectively .
We note that the general concentration inequalities derived in [1] can be applied to some configurations of the stationary Boolean model in , too. At least in the case of bounded grains, this application already improves the correspondent result of [7]. However, the functionals considered in [1] appear unable to incorporate the volume fraction. To be more precise, in the setting of Corollary 4.3, the bound (4.6) is superior to the result
[TABLE]
obtained from Corollary 3.3 in [1] by the bound
[TABLE]
Finally, we apply Theorem 2.5.
Proposition 4.11**.**
Assume that (4.2) holds. Then
[TABLE]
Proof.
By Lemma 3.3 and equation (4.3), we have, for -a.e. ,
[TABLE]
Using the properness of , we also get the bound
[TABLE]
The assertion now follows from Theorem 2.5 using the same truncation method as in the proof of Theorem 3.4. ∎
We note that actually equals the volume of the set of points which are covered by exactly one grain. Thus, as the Mecke formula allows us to employ the functional , we are equipped with a finer tool to respect the interplay between the grains of .
Example 4.12**.**
Let , that is the volume of the typical grain is exponentially distributed. The larger (and therefore the smaller ) the better is the specific bound (4.10) in comparison to the general bound (4.11). If , i.e. , then (4.10) outplays (4.11) uniformly. If , it is the other way round. Between, (4.11) might be better only for small values of . Comparing the more general bound (4.8) with (4.11), we see the same principle. The latter wins when is large.
Acknowledgment: We wish to thank S. Bachmann and G. Peccati for discussing with us an early version of their paper [1]. This work was supported by the German Research Foundation (DFG) through the research unit “Geometry and Physics of Spatial Random System” under the grant LA 965/6-2.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bachmann, S. and Peccati, G. (2016). Concentration bounds for geometric Poisson functionals: Logarithmic Sobolev inequalities revisited. Electron. J. Probab. 21 , 1-44.
- 2[2] Boucheron, S., Lugosi, G. and Massart, P. (2003). Concentration inequalities using the entropy method. Ann. Probab. 31 , 1583-1614.
- 3[3] Boucheron, S., Lugosi, G. and Massart, P. (2013). Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press.
- 4[4] Chernoff, H. (1952). A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 , 493-507.
- 5[5] Chiu, S.N., Stoyan, D., Kendall, W.S. and Mecke, J. (2013). Stochastic Geometry and its Applications. Third Edition, Wiley, Chichester.
- 6[6] Eichelsbacher, P., Raič, M. and Schreiber, T. (2015). Moderate deviations for stabilizing functionals in geometric probability. Ann. Inst. Henri Poincaré Probab. Stat. 51 , 89-128.
- 7[7] Heinrich, L. (2005). Large deviations of the empirical volume fraction for stationary Poisson grain models. Ann. Appl. Probab. 15 , 392-420.
- 8[8] Houdré, C. (2002). Remarks on deviation inequalities for functions of infinitely divisible random vectors. Ann. Probab. 30 , 1223-1237.
