
The construction of
In this paper we provide converge rates for the homogenization of the Poisson problem with Dirichlet boundary conditions in a randomly perforated domain of Rd, d⩾3. We assume that the holes that perforate the domain are spherical and are generated by a rescaled marked point process (Φ,R). The point process Φ generating the centres of the holes is either a Poisson point process or the lattice Zd; the marks R generating the radii are unbounded i.i.d random variables having finite (d−2+β)-moment, for β>0. We study the rate of convergence to the homogenized solution in terms of the parameter β. We stress that, for low values of β, the balls generating the holes may overlap with overwhelming probability.
Citation: Arianna Giunti. Convergence rates for the homogenization of the Poisson problem in randomly perforated domains[J]. Networks and Heterogeneous Media, 2021, 16(3): 341-375. doi: 10.3934/nhm.2021009
[1] | Arianna Giunti . Convergence rates for the homogenization of the Poisson problem in randomly perforated domains. Networks and Heterogeneous Media, 2021, 16(3): 341-375. doi: 10.3934/nhm.2021009 |
[2] | Martin Heida, Benedikt Jahnel, Anh Duc Vu . Regularized homogenization on irregularly perforated domains. Networks and Heterogeneous Media, 2025, 20(1): 165-212. doi: 10.3934/nhm.2025010 |
[3] | Martin Heida . Stochastic homogenization on perforated domains III–General estimates for stationary ergodic random connected Lipschitz domains. Networks and Heterogeneous Media, 2023, 18(4): 1410-1433. doi: 10.3934/nhm.2023062 |
[4] | Mamadou Sango . Homogenization of the Neumann problem for a quasilinear elliptic equation in a perforated domain. Networks and Heterogeneous Media, 2010, 5(2): 361-384. doi: 10.3934/nhm.2010.5.361 |
[5] | Brahim Amaziane, Leonid Pankratov, Andrey Piatnitski . Homogenization of variational functionals with nonstandard growth in perforated domains. Networks and Heterogeneous Media, 2010, 5(2): 189-215. doi: 10.3934/nhm.2010.5.189 |
[6] | Martin Heida . Stochastic homogenization on perforated domains Ⅰ – Extension Operators. Networks and Heterogeneous Media, 2023, 18(4): 1820-1897. doi: 10.3934/nhm.2023079 |
[7] | Leonid Berlyand, Petru Mironescu . Two-parameter homogenization for a Ginzburg-Landau problem in a perforated domain. Networks and Heterogeneous Media, 2008, 3(3): 461-487. doi: 10.3934/nhm.2008.3.461 |
[8] | Hakima Bessaih, Yalchin Efendiev, Florin Maris . Homogenization of the evolution Stokes equation in a perforated domain with a stochastic Fourier boundary condition. Networks and Heterogeneous Media, 2015, 10(2): 343-367. doi: 10.3934/nhm.2015.10.343 |
[9] | Oleh Krehel, Toyohiko Aiki, Adrian Muntean . Homogenization of a thermo-diffusion system with Smoluchowski interactions. Networks and Heterogeneous Media, 2014, 9(4): 739-762. doi: 10.3934/nhm.2014.9.739 |
[10] | Patrizia Donato, Florian Gaveau . Homogenization and correctors for the wave equation in non periodic perforated domains. Networks and Heterogeneous Media, 2008, 3(1): 97-124. doi: 10.3934/nhm.2008.3.97 |
In this paper we provide converge rates for the homogenization of the Poisson problem with Dirichlet boundary conditions in a randomly perforated domain of Rd, d⩾3. We assume that the holes that perforate the domain are spherical and are generated by a rescaled marked point process (Φ,R). The point process Φ generating the centres of the holes is either a Poisson point process or the lattice Zd; the marks R generating the radii are unbounded i.i.d random variables having finite (d−2+β)-moment, for β>0. We study the rate of convergence to the homogenized solution in terms of the parameter β. We stress that, for low values of β, the balls generating the holes may overlap with overwhelming probability.
In this paper we obtain convergence rates for the homogenization of the Poisson problem in a bounded domain of
{−Δuε=f in Dεuε=0 on ∂Dε | (1.1) |
We assume that, for
Eρ[ρd−2+β]<+∞, β>0. | (1.2) |
Here and below,
Hε:=⋃z∈Φ∩(1εD)B(εdd−2ρz)∧1(εz), (1εD):={x∈Rd:εx∈D}. | (1.3) |
As shown in [13], if
{−Δu+C0u=f in Du=0 on ∂D. | (1.4) |
The constant
C0:=cd{Eρ[ρd−2] if Φ=ZdλEρ[ρd−2]if Φ=Poi(λ), cd:=(d−2)Hd−1(Sd−1). | (1.5) |
In this paper, we strengthen the condition (1.2) on the integrability of the marks
By the Strong Law of Large Numbers, assumption (1.2) with
The presence of balls that overlap is the main challenge in the proof of the qualitative homogenization statement obtained in [13] and is one of the challenges of the current paper. It requires a careful treatment of the set
The main results contained in this paper provide an annealed (i.e. averaged in probability) estimate for the
1 In the case of
E[‖uε−Wεu‖2H10(D)]12⩽C{εdd2−4β if β⩽d−2εdd+2 if β>d−2 | (1.6) |
We stress that in the case of periodic holes, namely when
The main quantity that governs the decay of the homogenization error
Cap(A∩Hε)≃∑z∈(εZ)d∩ACap(Bεdd−2r(z))≃|A|ε−dcd(εdd−2r)d−2(1.5)=C0|A|, | (1.7) |
and this chain of identities is true as long as
Starting with [6] and [21], there is a large amount of literature devoted to the homogenization of (1.1), both for deterministic and random holes
For what concerns quantitative rates of convergence for (1.1) to (1.4), the first result in the periodic case is contained in [18]. When the holes are randomly distributed, the first quantitative result has been obtained in [9]. In this paper, the authors study the analogue of (1.1) for the operator
The quantitative estimates developed in this paper are also used in [10] to obtain homogenization results for solutions to (1.1) and the analogous Stokes system in the regimes leading to Darcy's law. In [10], the radii in (1.3) are rescaled by a factor
We conclude this introduction mentioning that the analogue of (1.1) for a Stokes (and Navier-Stokes) system with no-slip boundary conditions on the holes
Let
We denote by
Throughout this paper we assume that
(i)
(ii) The marks
gn((z1,ρ1),⋯,(zn,ρn))=Πni=1g1((zi,ρi)), g1((z,ρ))=g(ρ). |
(iii) The marks
Eρ[ρd−2+β]=∫+∞0ρd−2+βg(ρ)dρ⩽1, with β>0. | (2.1) |
We stress that conditions (i)-(ii) yield that
Notation. When no ambiguity occurs, we skip the argument
Φ(A):={z∈Φ:z∈A}, Φε(A):={z∈Φ:εz∈A} | (2.2) |
and the random variables
N(A):=#(Φ(A)), Nε(A):=#(Φε(A)). | (2.3) |
For any for the averaged sum
For two sets
Before stating the main results, we need to define a suitable corrector function
Rε,x:=ε4minz∈Φε(D),z≠x{|z−x|;1} | (2.4) |
Note that, if
Φεδ(D):={z∈Φε(D):εdd−2ρz⩽ε1+δ,Rε,z⩾2√dεdd−2ρz∨ε2}, | (2.5) |
where here and through out the paper
For each
{−Δwz,ε=0 in BRε,z(εz)∖Bεdd−2ρz(εz)wz,ε=0 on ∂BRε,z(εz)wz,ε=1 on ∂BRε,z(εz). | (2.6) |
We thus define
Wε(x)={wz,ε if x∈BRε,z(εz)∖Bεdd−2ρz(εz)0 if x∈Bεdd−2ρz(εz)1 otherwise | (2.7) |
We stress that (2.5) ensures that definitions (2.6) and (2.7) are well-posed since the set
Theorem 2.1. Let
δ={4d2−4 if β⩽d−22d−2−2d(d+2)β if β>d−2 |
(a) If
E[‖uε−Wεu‖2H10(D)]12⩽C{εdd2−4β if β⩽d−2εdd+2 if β>d−2 |
(b) If
E[‖uε−Wεu‖2H10(D)]12⩽C{|logε|ε35β if β⩽1|logε|ε35 if β>1 |
Remark 2.2. As shown throughout Section 4, the argument of Theorem 2.1 (b) applies also to higher dimensions
We expect that the techniques used to prove Theorem 2.1 do extend to other examples of stationary random distributions of centres. For instance, to point processes that satisfy a finite-range of dependence assumption and for which the expected number of elements in a finite set
Remark 2.3. As it becomes apparent in the proof of Theorem 2.1, the choice of
The proof of Theorem 2.1 is inspired to the proof of the same result in the case of periodic holes shown in [18]. The latter, in turn, upgrades the result of [6] from the qualitative statement
The functions
με=∑z∈Zd∩1εD∂nwε,zδ∂Bε4(εz), | (2.8) |
that is concentrated on the spheres
In [18], the corrector
∫∂Bε4(0)∂nwε=εd(C0+O(ε2)). | (2.9) |
In this paper we adapt to the random setting the previous two-step argument. The first main difference is strictly related to the randomness of the radii in
(2.10) |
Here, the last term accounts for the difference between the average of
E[∥με−C01D∥2H−1(D)]12≲kε+Eρ[(ρd−2−Eρ[ρd−2])2]12k−d2. |
The optimal choice of
In the case of centres distributed according to a Poisson point process, the argument for Theorem 2.1 follows the same ideas sketched above. Although the centres of the holes in
A second challenge that arises in the proof of Theorem 2.1 is related to the presence of overlapping holes in the case
This subsection contains some technical tools that will be crucial to prove the main result: The first one is an adaptation of [13] and provides a suitable way of dividing the holes
Lemma 3.1. Let
Hε:=Hεg∪Hεb |
with the following properties:
● There exists a subset of centres
Hεg:=⋃z∈nε(D)Bεdd−2ρz(εz), maxz∈nε(D)εdd−2ρz⩽ε1+δ; | (3.1) |
● There exists a set
Hεb⊆Dεb, Cap(Hεb,Dεb)≲εd∑z∈Φε(D)∖nε(D)ρd−2z | (3.2) |
and
Bε4(εz)∩Dεb=∅, for every z∈nε(D). | (3.3) |
Proof of Lemma 3.1. The construction for the sets
We denote by
Jεb=Φε(D)∖Φεδ(D)={z∈Φε(D):εdd−2ρz⩾ε1+δ}. | (3.4) |
Given the holes
˜Iεb:={z∈Φε(D)∖Jεb:˜Hεb∩Bε4(εz)≠∅}. | (3.5) |
We define
Iεb:=˜Iεb∪Jεb, nε(D):=Φε(D)∖IεbHεb:=⋃z∈IεbBεdd−2ρz∧1(εz), Hεg:=⋃zj∈nε(D)Bεdd−2ρz(εz),Dεb:=⋃z∈IεbB2(εdd−2ρz∧1)(εz). | (3.6) |
It remains to show that the sets defined above satisfy properties (3.1)-(3.3). Property (3.1) is an immediate consequence of definition (3.4). The first inclusion in (3.2) follows by the definition of
Cap(Hεb;Dεb)⩽∑z∈Φε(D)∖nε(D)Cap(Bεdd−2ρz∧1(εz);Dεb). |
Moreover, by the monotonicity property
Cap(Hεb;Dεb)⩽∑z∈Φε(D)∖nε(D)Cap(Bεdd−2ρz(εz);B2εdd−2ρz(εz))≲εd∑z∈Φε(D)∖nε(D)ρd−2z, |
i.e. the estimate in (3.2).
To conclude the proof of this lemma, it remains to argue (3.3): By construction (see (3.6)), it holds that
Dεb=˜Hεb∪⋃z∈˜IεbB2εdd−2ρz(εz). | (3.7) |
On the one hand, by (3.5) and the definition of
dist(εz;˜Hεb)⩾ε4. | (3.8) |
On the other hand, by (3.4) and (3.5), if
dist(εz;B2εdd−2ρw(εw))⩾ε2|z−w|⩾ε4, |
whenever
dist(εz;⋃z∈˜IεbB2εdd−2ρz(εz))⩾ε4. |
Combining this with (3.8) and (3.7), we infer (3.3). The proof of Lemma 3.1 is complete.
We now construct a suitable covering of
For
Qε,z:=εz+εQ, Q:=[−1;1]d | (3.9) |
while for
Qk,z:=εz+(2k+1)ε2Q. | (3.10) |
Let
#(Nk)≲(εk)−d. | (3.11) |
Let
N˚ | (3.12) |
Since
(3.13) |
Finally, for each
(3.14) |
Note that, since in this section we assumed that
All the results contained in this subsection are quenched, in the sense that they hold for any fixed realization of the holes
Before giving the statement of Lemma 3.2, we recall the construction of the oscillating test function
Let
2 We assume that the minimizer exists. If this is not the case, it suffices to take
We pick as oscillating test function
(3.15) |
where
(3.16) |
and
(3.17) |
For each
(3.18) |
For
(3.19) |
Lemma 3.2. Let
Lemma 3.2 relies on the next lemma, that is an adaptation of [18][Theorem 3.2] and shows that controlling the error
Lemma 3.3. Let
with
(3.20) |
Proof of Lemma 3.2. The statement follows from Lemma 3.3, provided that we show that
(3.21) |
and that for every
(3.22) |
We first argue (3.21): By definition (3.16) for
(3.23) |
Since by Lemma 3.1 the sets
(3.24) |
The function
Using definitions (3.17), (2.6) and property (3.1) of Lemma 3.1, we may rewrite
and, inserting this into (3.24), also
(3.25) |
To conclude the proof of (3.21) for
To establish (3.21) for
We now argue (3.21) for
(3.26) |
Thanks to definition (3.15) for
(3.27) |
Comparing definition (3.17) for
Since the balls
Inserting this bound into (3.27) yields (3.21) also for the norm of
We now turn to (3.22) and claim that we may apply Lemma 5.1 with
By the triangle inequality and the previous estimate, we thus bound
(3.28) |
so that, to prove (3.22), it only remains to control the last term on the right-hand side above. We do this by observing that, since
By the triangle inequality, also
(3.29) |
We claim that
(3.30) |
This is an easy consequence of the properties of the covering
We now turn to the second term in (3.29). We note that, by definition (3.12), the set
Since
Appealing once again to Cauchy-Schwarz's inequality and using the above estimate, we control
Hence, provided
Combining this with (3.30) and (3.29) allows us to infer that for every
or, equivalently, that
This, together with (3.28), establishes (3.22). The proof of Lemma 3.2 is complete.
Proof of Lemma 3.3. The argument for this lemma is very similar to the one of [18,Theorem 3.1]. Since
(3.31) |
We now smuggle the term
We stress that, since
(3.32) |
Since the balls
Since
Inserting this last identity in (3.32), we infer that
We now choose
To obtain the claim of Lemma 3.3 it remains to use that, by the triangle inequality and Hölder's inequality, we have
and that, by definitions (2.7) and (3.15), the difference
In this subsection we rely on the quenched estimate of Lemma 3.2 to prove the statement of Theorem 2.1 in the case of periodic centres. The first ingredient is the following annealed bound:
Lemma 3.4. Let
Proof of Theorem 2.1,
Combining Lemma 3.2 and Lemma 3.4, we bound for every
Since the sets
We observe that, by (2.5), (2.1) and the inequality
Since
(3.33) |
We now claim that for every
(3.34) |
where
Let us first assume that (2.1) holds with
and therefore that
(3.40) |
Estimate of Theorem 2.1 for
Let us now assume that
so that (3.34) turns into
Also in this case, we infer the estimate of Theorem 2.1 by minimizing the right-hand side in
To complete the proof of the theorem it only remains to argue (3.34) from (3.33). We first tackle the second term on the right-hand side of (3.33) and show that
(3.35) |
This may be done after noticing that the left-hand side may be written, up to an error, as the sum of
(3.36) |
Since
(3.37) |
Thanks to Chebyshev's inequality and assumption (2.1) we have
(3.38) |
and thus we may rewrite (3.37) as
Since
the independence of the random variables
We now turn to the remaining term in (3.33) and argue that
(3.39) |
By the triangle inequality and assumption (2.1), the left-hand side is bounded by
(3.40) |
To establish (3.39) from this it suffices to remark that, by (3.19) and (3.36), we have
so that this, and the fact that the random variables
Inserting this into (3.40) implies (3.39). To establish (3.34) it remains to combine (3.39), (3.35) and (3.33). The proof of Theorem 2.1,
Proof of Lemma 3.4. We resort to the construction of the set
(3.41) |
and prove the statement of Lemma 3.4 for each one of the two sums. We begin with the first one: Using (3.4) we write
Taking the expectation and using that
(3.42) |
i.e. the claim of Lemma 3.4 for the first sum in (3.41).
We now turn to the second sum in (3.41): By definition (3.5), if
We now take the expectation and use that
Since for every
we obtain that
This, together with identities (3.41) and (3.42), establishes Lemma 3.4.
In this section we adapt the argument of the previous section to Theorem 2.1 in case
All the results contained in this section besides hold for any dimension
Throughout this section we set
(4.1) |
This subsection contains an adaptation to the case of random centres of Lemma 3.1 and of the sets
Lemma 4.1. Let
with the following properties:
● There exists a subset of centres
and such that
● There exists a set
and for which
Proof of Lemma 4.1. The construction for the sets
and in the definition (3.5) of
For
For
(4.2) |
We aim at obtaining a (random) collection of disjoint sets
We modify
Note that, by definition (2.4), all the cubes above are disjoint. For every
(4.3) |
The construction of
Since the cubes
(4.4) |
We emphasize that the previous properties hold for every realization of the point process
In this section we adapt Lemma 3.2 to the current setting. As in the case of Lemma 3.2, the next result relies on a variation of Lemma 3.3 that allows us to replace in the definition (3.20) of
We define the oscillating test function
(4.5) |
Lemma 4.2. Let
Lemma 4.3. Let
where
with
Proof of Lemma 4.2. Analogously to the proof of Lemma 3.2, we appeal to Lemma 4.3 and reduce to showing that
(4.6) |
(4.7) |
and
(4.8) |
Inequality (4.6) may be argued exactly as done for (3.21) in the proof of Lemma 3.2, this time appealing to Lemma 4.1 instead of Lemma 3.1.
We thus turn to (4.7). We begin by remarking that
(4.9) |
Since, if
Appealing to (2.7), (2.6) and the adaptation of (3.18) for both
Since
Inserting this into (4.9) and appealing to (4.1) for
We finally tackle (4.8): As done for (3.22) of Lemma 3.2, we aim at applying Lemma 5.1. We thus pick
where, thanks to (4.5), we have that
Proof of Lemma 4.3. This lemma may be argued as done for Lemma 3.3. The only difference is that, in (3.31), we smuggle in
As in case
Lemma 4.4. Let
Proof of Theorem 2.1,
As done in the proof of Theorem 2.1 (a), this also turns into
(4.10) |
We now claim that, thanks to (4.1), the previous estimate reduces to
(4.11) |
If the previous estimate holds, by the choice of
which establishes Theorem 2.1,
To conclude the proof, we only need to obtain (4.11) from (4.10). The sum over
(4.12) |
(4.13) |
and
(4.14) |
We argue (4.13): Recalling the definition of the covering
and rewrite
Since the process
(4.15) |
Let us partition the cube
(4.16) |
We now apply Lemma 5.2 with
(4.17) |
We rewrite
We claim that
This inequality, indeed, is obtained by decomposing the indicator function above into
and using that, by definition (2.4), it holds
where
(4.18) |
Inserting this into (4.17) we obtain that for
Thus, inequality (4.15) turns into
This yields (4.13) provided that
(4.19) |
Let
Since we may decompose the set
(4.20) |
where
3 In this last step one should distinguish between unitary cubes according to the number of faces that they share with
and use (4.2) to rewrite
We now appeal again to Lemma 5.2 as for (4.16) to reduce to
Arguing as for (4.18) and using the stationarity of
To establish (4.19) it only remains to combine the previous inequality with (4.20) and use (4.1). The proof of (4.13) is therefore complete.
Inequality (4.12) may be obtained in a similar way as to that of (4.13): Since we may decompose the set
so that, again by Lemma 5.2, we obtain
We establish (4.12) after observing that, thanks to (4.1), it holds
We now tackle (4.14): As in the proof of case
where
with
(4.21) |
We rewrite
so that the triangle inequality, assumption (2.1) and the quenched bounds in (4.4) yield
Appealing to definitions (4.21), (4.5) and (2.4), we observe that
(4.22) |
To establish (4.14) from (4.22) it suffices to bound
(4.23) |
(4.24) |
We emphasize that in the first bound the right-hand side may be bounded by
Inequality (4.23) follows from Cauchy-Schwarz's inequality, the triangle inequality and definitions (4.21) and (4.5). We thus turn to (4.24) and fix
we use this and (4.21) to rewrite
Observing that
we infer that
We now appeal to Lemma 5.2 with
By the properties of the Poisson point process and definition (2.4) this yields
Hence
(4.25) |
To establish (4.24) it remains to bound the last term above by
We now observe that if
(4.26) |
If, otherwise,
Using that, if
(4.27) |
Combining (4.27) and (4.26) with (4.25) implies (4.24) and, in turn, (4.14). The proof of Theorem 2.1 is complete.
Proof of Lemma 4.4. The proof of this lemma follows the same lines of the argument for Lemma 3.4. We resort to the construction made in Lemma 4.1 (c.f. (3.6)) to decompose
(4.28) |
The expectation of the first sum may be bounded by by
By Lemma 5.2 applied to
we infer that
Since the marks
(4.29) |
Since
(4.30) |
We now turn to the second term in (4.29): Since this term reduces to the values
Using Hölder's inequality with exponents {
(4.31) |
We control the last term by
Since
Let
(5.1) |
We define the measure
(5.2) |
where each
The next lemma is a generalization of the result by [19] used in [18] to show the analogue of Theorem 2.1 in the case of periodic holes
Lemma 5.1. Let
(5.3) |
we have that
with
(5.4) |
Here, the constant
The next result is a consequence of the assumptions (i)-(iii) on the marked point process
Lemma 5.2. Let
Proof of Lemma 5.1. With no loss of generality, we give the proof for
(5.5) |
By the definition of the capacitary functions
(5.6) |
For every
(5.7) |
We stress that
By (5.7) and (5.5)-(5.6), we thus have that
The statement of Lemma 5.1 holds, provided that we show that for each
(5.8) |
We argue (5.8) as follows: testing (5.7) with
By Cauchy-Schwarz's inequality and by the definition of
(5.9) |
By the trace estimate for functions
inequality (5.9) turns into
Since by (5.3) we have
This, Cauchy-Schwarz's inequality, and (5.1) further yield
Since by (5.7) the function
This establishes (5.8) and, in turn, concludes the proof of Lemma 5.1.
Proof of Lemma 5.2. Without loss of generality we assume that
Appealing to Fubini's theorem and relabelling the elements
i.e.
The author thanks the anonymous referees for the helpful comments and suggestions on the first version of the paper.
1. | A. Giunti, Derivation of Darcy’s law in randomly perforated domains, 2021, 60, 0944-2669, 10.1007/s00526-021-02040-3 | |
2. | Lucia Scardia, Konstantinos Zemas, Caterina Ida Zeppieri, Homogenisation of nonlinear Dirichlet problems in randomly perforated domains under minimal assumptions on the size of perforations, 2024, 0178-8051, 10.1007/s00440-024-01320-1 | |
3. | Richard M. Höfer, Jonas Jansen, Convergence Rates and Fluctuations for the Stokes–Brinkman Equations as Homogenization Limit in Perforated Domains, 2024, 248, 0003-9527, 10.1007/s00205-024-01993-x | |
4. | Hiroto Ishida, Homogenization for Poisson equations in domains with concentrated holes, 2023, 59, 0916-5746, 10.55937/sut/1698476840 |
The construction of