Maximum of Branching Brownian motion in a periodic environment
Eyal Lubetzky, Chris Thornett, Ofer Zeitouni

TL;DR
This paper investigates the asymptotic behavior of the maximum of branching Brownian motion in a periodic environment, establishing convergence in distribution and identifying the limiting distribution, thus advancing understanding of pulsating fronts in related PDEs.
Contribution
It proves the convergence in distribution of the centered maximum of BBM in a periodic environment and identifies the limiting distribution, addressing a key open question.
Findings
Established convergence in distribution of the centered maximum
Identified the limiting distribution explicitly
Determined the asymptotic shift for the F-KPP solution with pulsating waves
Abstract
We study the maximum of Branching Brownian motion (BBM) with branching rates that vary in space, via a periodic function of a particle's location. This corresponds to a variant of the F-KPP equation in a periodic medium, extensively studied in the last 15 years, admitting pulsating fronts as solutions. Recent progress on this PDE due to Hamel, Nolen, Roquejoffre and Ryzhik ('16) implies tightness for the centered maximum of BBM in a periodic environment. Here we establish the convergence in distribution of specific subsequences of this centered maximum, and identify the limiting distribution. Consequently, we find the asymptotic shift between the solution to the corresponding F-KPP equation with Heavyside initial data and the pulsating wave, thereby answering a question of Hamel et al. Analogous results are given for the cases where the Brownian motion is replaced by an Ito diffusion…
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
TopicsStochastic processes and statistical mechanics · Stochastic processes and financial applications · Theoretical and Computational Physics
Maximum of Branching Brownian motion
in a periodic environment
Eyal Lubetzky
Eyal Lubetzky Courant Institute
New York University
251 Mercer Street
New York, NY 10012, USA.
,
Chris Thornett
Chris Thornett Courant Institute
New York University
251 Mercer Street
New York, NY 10012, USA.
and
Ofer Zeitouni
Ofer Zeitouni Department of Mathematics
Weizmann Institute of Science
POB 26, Rehovot 76100, Israel
and Courant Institute
New York University
Abstract.
We study the maximum of Branching Brownian motion (BBM) with branching rates that vary in space, via a periodic function of a particle’s location. This corresponds to a variant of the F-KPP equation in a periodic medium, extensively studied in the last 15 years, admitting pulsating fronts as solutions. Recent progress on this PDE due to Hamel, Nolen, Roquejoffre and Ryzhik (’16) implies tightness for the centered maximum of BBM in a periodic environment. Here we establish the convergence in distribution of specific subsequences of this centered maximum, and identify the limiting distribution. Consequently, we find the asymptotic shift between the solution to the corresponding F-KPP equation with Heavyside initial data and the pulsating wave, thereby answering a question of Hamel et al. Analogous results are given for the cases where the Brownian motion is replaced by an Ito diffusion with periodic coefficients, as well as for nearest-neighbor branching random walks.
1. Introduction
In classical Branching Brownian motion (BBM), initially there is a single particle at the origin, performing standard Brownian motion; a particle is associated with a rate-1 exponential clock which, upon ringing, causes it to be replaced by two new particles at that location, each evolving thereafter independently in the above manner. The location of the rightmost particle in this process after time , denoted , has been extensively studied, due in part to its connection to the behavior of extreme values in the Discrete Gaussian Free Field (and other log-correlated fields; see for instance [5, 24]), and to the F-KPP equation, proposed almost a century ago by Fisher [10] and by Kolmogorov, Petrovskii and Piskunov [17] to model the spread of an advantageous gene in a population:
[TABLE]
with
[TABLE]
As found by McKean [20], BBM gives a probabilistic representation to (1.1) with initial conditions via , where is the set of particles at time , and is the location of the particle at that time. With this interpretation, solves (1.1), (1.2).
Bramson [8, 6] was then able to use probabilistic methods—which later had a large impact in the study of extremes of logarithmically correlated fields—in a sharp analysis of the maximum of BBM: the median of is (with its logarithmic “Bramson correction” term differing from the second order term in the maximum of i.i.d. Brownian motions), and converges in law to a random variable , later identified by Lalley and Selke [18] to be a randomly shifted Gumbel random variable.
A version of the F-KPP equation studied by H. Berestycki, H. Hamel [2], followed by a series of papers (cf. [4, 3, 13] to name a few), replaced the function in (1.2) by a function that is periodic in and is a KPP-type nonlinearity. The case
[TABLE]
corresponds to BBM in a periodic environment, where the constant branching rate is replaced by a space-dependent rate prescribed by the function . That is, if and are the birth time and death times of the particle , respectively, and we fictitiously extend beyond its death time , then
[TABLE]
Upon dying, the particle then gives birth to two identical particles at its position who then continue independently under Brownian motion.
A recent breakthrough in analyzing the solution to this flavor of the F-KPP equation (and more generally, allowing for any of KPP-type) due to Hamel, Nolen, Roquejoffre and Ryzhik [12] generalized Bramson’s results to the case of periodic environments. In particular, for the maximum of BBM with branching rates given by as per (1.3), the results of [12] imply that its median is within order of
[TABLE]
and that is tight.
Before we state our main result, let us briefly define and . As discussed in [12], the key is a class of eigenproblems. For every , let and be the principal eigenvalue and positive eigenfunction of the periodic problem
[TABLE]
normalized so that . We define
[TABLE]
The existence of will be proved in Section 2.
Our main result establishes that, in this setting, is tight, and we identify sequences along which converge in distribution, along with the limits.
Theorem 1**.**
Let be the maximum at time of BBM with branching rates given by a strictly positive and 1-periodic function as in (1.4), and let . Then there exist a random variable and a positive, continuous, -periodic function such that
[TABLE]
for all . In particular, if is an increasing sequence such that has constant fractional part, then converges in distribution.
The random variable can be described as an appropriate limit, see (4.7) below. The implicitly defined function , whose existence is a consequence of Proposition 3.6, captures the possible variability of the tail of the law of as function of the initial condition. We do not rule out the possibility that is actually a constant.
Our analysis has the following consequence for the behavior of the solution to the F-KPP equation in a periodic medium:
Corollary 2**.**
Let be the solution to the F-KPP equation
[TABLE]
and let . There exists a function , satisfying , such that
[TABLE]
The function is given explicitly in (4.9).
Recall that, in the context of the F-KPP equation in a periodic medium such as the one described in the above corollary, a pulsating wave is a solution to this equation which satisfies . It is known that no such solution exists for , whereas if then such a solution exists and is unique up to time-shifts (see [12, p. 467] and the references therein for more details). It was shown in [12, Thm. 1.2] (in a much greater generality than we can treat by probabilistic methods, and in particular for more general nonlinearities and initial conditions) that the solution to (1.8) satisfies uniformly in for some bounded function .
Combining this with Corollary 2, and using that as , we see that as , uniformly in , for some bounded function . Equation 4.9 then gives a representation of the pulsating wave.
The structure of the paper is the following. Section 2 discusses some preliminaries from the theory of Branching Brownian motions and large deviations, such as Many-to-One (Two) lemmas, tilting, and barrier estimates; the proof of a technical ballot theorem (Lemma 2.8) is postponed to Appendix A. Section 3, which is the heart of the paper and technically the most challenging, uses these to derive the crucial Proposition 3.6, which gives the exact asymptotics for the right tail of the law of . The argument uses a first and second moment method, in the spirit of standard proofs in the theory of branching random walks, see e.g. [1] and [23]; Our argument is closest to [7]. However, the periodicity of the coefficients forces significant departure from the standard approach, and in particular forces us to work with certain stopping lines in order to recover an independent increments structure. The proof of the main results follows relatively quickly from the tail estimate, and is provided in Section 4. Finally, Section 5 discusses extensions to Branching Brownian Motion with periodic drift and diffusion coefficients, and to branching integer-valued random walks with periodic branching rates.
2. Preliminaries
We begin with some important preliminary estimates. First, we define some of the notation we will need later on.
In addition to our BBM, it will be helpful to consider a standard Brownian motion and its measure under which . We will abbreviate , and let be its natural filtration.
Analogously, it will often be convenient to consider a different probability measure under which the BBM begins at , rather than zero. Note that this equivalent to replacing the branching rate with and the process with . Replacing by in (1.6) above, one sees that the eigenvalues (and in particular and ) do not change, whereas is replaced by . Notice that since, for any given , is positive, continuous and -periodic, it is bounded above and below by positive constants. When we refer to this fact, we will often simply say “ is bounded” for brevity.
Recall that denotes the set of particles alive at time , and that is the position at time of a particle . For every , we extend the latter definition and let for denote the position of the unique ancestor of that is alive at time (whenever this unique ancestor would be itself). Similarly, for a particle which is alive before time , we let be the maximum of amongst those particles which are direct descendants of .
Let be the set of all particles. Given a -almost surely finite -stopping time , we let be the analogous stopping time for and define the stopping line
[TABLE]
and consider . Observe that if is constant, then , so our notation is consistent.
Finally, we note that we will regularly use to denote a universal positive constant which may change from line to line. For any specific constant that is kept fixed throughout, we will use a different symbol.
2.1. Many-to-few lemmas and large deviations estimates
The Many-to-One Lemma and Many-to-Two Lemma, which can be traced back to the works [21, 15] (see also [14]), will both be essential for our analysis. The stopping line version we state, along with a more general introduction to stopping lines, can be found in [19, §2.3].
Lemma 2.1** (Many-to-One Lemma).**
Let be a -almost surely finite -stopping time, and let be a measurable function such that f\big{(}\{B_{s}\}_{s\geq 0}\big{)} is -measurable. Then
[TABLE]
In the next lemma, we set where is some continuous function (in our application, will always be an affine function). The statement holds in greater generality and can be deduced from [19, Lemma 2.3.3] by considering the process stopped upon exiting the domain .
Lemma 2.2** (Many-to-Two Lemma).**
Assume the set-up of Lemma 2.1, and in addition suppose is of the form
[TABLE]
Define
[TABLE]
Then
[TABLE]
if is a constant, and
[TABLE]
if is the first hitting time of a closed set .
After applying these lemmas, we will want to use an exponential change of measure (tilt) that makes the term vanish. With as in (1.6), define the function
[TABLE]
Notice that is -periodic, and it follows from the definition and (1.6) that
[TABLE]
With as in (2.3), consider the process satisfying
[TABLE]
where is a standard Wiener process, and let denote the associated measure.
Since is -periodic, it follows that the law of is the same under as under . Moreover, this process provides us with our desired tilt.
Lemma 2.3**.**
For any , , and any measurable function , we have that
[TABLE]
Proof.
This will follow immediately from the Girsanov formula if we can show that
[TABLE]
(Note that for fixed , the left hand side is uniformly bounded, and so Novikov’s condition [22, Proposition VIII.1.15] is trivially satisfied.) To prove (2.6), first note that by (2.3) and Ito’s lemma,
[TABLE]
Rearranging the above display, we find
[TABLE]
plugging in (2.4), we obtain (2.6) and complete the proof. ∎
Remark 2.4**.**
Since the Radon-Nikodym derivative is a martingale, (2.5) remains true when is replaced by a bounded stopping time . It hence also holds for any stopping time if there exists a deterministic such that is zero on , since on this event is equal to the bounded stopping time .
We are interested in performing this tilt with of (1.7), which we have not yet shown to exist. We do this in the following lemma.
Lemma 2.5**.**
The function is analytic and convex on . Moreover, there exists a unique such that
[TABLE]
and this quantity is positive.
Proof.
That is analytic follows from standard analytic perturbation theory, see e.g. [16, Example VII.2.12]). Moreover, since is bounded, we may apply Lemma 2.3 to deduce
[TABLE]
(In fact, the term is also uniform for if is compact, but we do not use this.) If and are the respective lower and upper bounds of , then (2.7) and the identity imply that
[TABLE]
It follows that as both and . Thus, since is continuous, it follows that
[TABLE]
exists, and applying (2.8) again implies that . Let be a minimizer. Then
[TABLE]
that is, . If were not unique, the convexity of would imply that is constant on an interval, and analyticity would then imply that is affine. But this is clearly impossible by (2.8), so is unique. ∎
From now on, we will deal exclusively with . Since and is bounded, Lemma 2.1 and Lemma 2.3 imply
[TABLE]
for any . Thus, studying asymptotics for will be crucial in our proof. We begin with a large deviations principle.
Lemma 2.6**.**
Let be the law of under . Then satisfies a large deviations principle with good, convex rate function
[TABLE]
where \gamma^{*}(z)=\sup_{\lambda\in\mathbb{R}}\big{\{}\lambda z-\gamma(\lambda)\big{\}} denotes the Legendre transform of .
Proof.
That is a convex rate function follows from the convexity of and the definition of . For the large deviations principle, observe from (2.5) that for any ,
[TABLE]
Since is bounded, it follows from (2.7) that
[TABLE]
The right hand side of the above display is a globally differentiable function of by Lemma 2.5, and so by the Gärtner–Ellis Theorem (cf., e.g., [9, §2.3]), it follows that satisfies a large deviations principle with rate function
[TABLE]
as claimed. Finally, to see that is a good rate function, fix . Then, if then
[TABLE]
while if then
[TABLE]
This implies that , as needed. ∎
Corollary 2.7**.**
For any , one has that , -almost surely.
Proof.
Note that if and only if . Thus, for any , one has , and
[TABLE]
Moreover, by applying Lemma 2.3 and performing a standard computation for Brownian motion, one has
[TABLE]
uniformly for . Observing that is -periodic in , the bound in (2.11) is thus uniform for . Thus, for any , one has
[TABLE]
where the second line follows from the Markov property. It thus follows from the Borel-Cantelli lemma that
[TABLE]
-almost surely, and the claim follows. ∎
Combining Corollary 2.7 with the discussion above Lemma 2.6, we see that the expected number of particles within of has order . To improve these estimates, one could develop more precise results for the asymptotic behavior of ; however, we will instead use a renewal approach.
We introduce the hitting times: for ,
[TABLE]
This is a -almost surely finite stopping time with exponential tails, since for sufficiently large , and so
[TABLE]
by Lemma 2.6. Moreover, -almost surely, provided . The key observation is that, by the strong Markov property, is IID under for any , with law equal to that of under . Moreover, -almost surely, and so
[TABLE]
-almost surely by Corollary 2.7. This motivates the definition
[TABLE]
which is a mean zero random walk which satisfies for , for some .
Intuitively, for , should have asymptotics which are not too different from those of . Since the asymptotics of sums of IIDs are well understood, it will be beneficial in many cases to convert required estimates into statements about . This motivates the next subsection, where we will state some barrier estimates both of and which we will need in our proof of Theorem 1.
2.2. Barrier estimates
Our first result in this subsection, Lemma 2.8, is a collection of barrier estimates for , and will serve as our primary tool moving forward. The lemma is a slight generalization of [7, Lemma 2.2 and Lemma 2.3], and the proof, based on the latter, is given in Appendix A.
In what follows, we will make use of functions which satisfy, for some , ,
[TABLE]
where is the support of .
Lemma 2.8**.**
Let be a real sequence which satisfies for some ; define . Then there exists such that
[TABLE]
for all , and , and
[TABLE]
for all , and . Moreover, there exists and an increasing function satisfying such that
[TABLE]
for all , , and satisfying (2.14), where
[TABLE]
Furthermore, if is a strictly increasing, concave function satisfying and for some , then there exists satisfying such that
[TABLE]
for all , , and satisfying (2.14). Finally, there exists such that
[TABLE]
for all , , and .
The constants in (2.15), (2.16) and (2.19) depend on and (and in the latter case), but not on or the choice of ; similarly, the constant and the function depend only on the distribution of ; and the rates of convergence in (2.17) and (2.18) may depend on , , and the bounds and Lipschitz constant of (and in the latter case), but not on or .
While Lemma 2.8 contains most of the estimates we need to prove Theorem 1, we will occasionally need versions of (2.15) and (2.16) for . We end this section by providing these results.
Lemma 2.9**.**
Let be a continuous function such that and for some , and define
[TABLE]
Then there exists a constant such that
[TABLE]
for all , , , and , and
[TABLE]
for all , and .
Proof.
We begin with (2.20). Fix and assume , since if not, a basic large deviations estimate (c.f. Lemma 2.6) yields a sharper bound. For and , define and
[TABLE]
By the strong Markov property, one has
[TABLE]
Let , observing that
[TABLE]
for constants depending on and , but not on (since ). Thus, defining , (2.15) of Lemma 2.8 implies
[TABLE]
for all , where the constant does not depend on . Moreover, one has , and
[TABLE]
where . Hence, by (2.23), we have
[TABLE]
where the second inequality follows since and .
Now notice that, on the event \big{\{}t-T_{n(j)}\in[\ell,\ell+1)\big{\}}, one has
[TABLE]
and
[TABLE]
for appropriate . This last inequality comes from the fact that, if is the first time hits , then is the sum of IID copies of , which is finite with probability since .
Combining the previous two displays, one deduces
[TABLE]
on the event \big{\{}t-T_{n(j)}\in[\ell,\ell+1)\big{\}}. Plugging (2.25) back into (2.22) along with (2.24) and summing over and , we conclude
[TABLE]
proving (2.20).
We are left with proving (2.21). Let , and consider the event
[TABLE]
where is as before. On , for and one has
[TABLE]
and hence by the strong Markov property,
[TABLE]
Set , which is in . On the event \big{\{}t-T_{N}\in\left[\frac{1}{2q_{t}},\frac{1}{q_{t}}\right]\big{\}}, we have
[TABLE]
where the latter inequality follows by applying Lemma 2.3 and bounding the Radon-Nikodym derivative from below. Using elementary tools for Brownian motion, this last probability can be bounded below by a constant . Thus, plugging into (2.26), we see
[TABLE]
Finally, since for some , (2.16) of Lemma 2.8 implies
[TABLE]
and combined with (2.27), this implies (2.21) and completes the proof. ∎
3. Estimates on the right tail of BBM
In this section, we state and prove several important estimates of \mathbb{P}^{x}\Big{(}M_{t}>m_{t}+y\Big{)}. To begin with, we focus on upper and lower bounds, but eventually we will need asymptotics as followed by .
Throughout this section, we fix . Note that satisfies the conditions of Lemma 2.9.
3.1. Upper and lower bounds
The main goal of this subsection is to show that \mathbf{P}^{x}\Big{(}M_{t}>m_{t}+y\Big{)}/ye^{-\lambda^{*}y} is bounded above and below by positive constants. We begin with the following. In analogy with (2.12), introduce for and ,
[TABLE]
With this, recall the notation , see the discussion in the beginning of Section 2.
Lemma 3.1**.**
Define the event
[TABLE]
where . Then there exist such that for all , and ,
[TABLE]
where
[TABLE]
Remark 3.2**.**
For , this is simply Lemma in [BDZ] for the Branching Random Walk . However, this Branching Random Walk does not satisfy the assumptions of that paper (in particular, one has ), and the uniformity in may not be immediately obvious, so we provide a full proof.
Proof.
Let W_{k}^{(N,v)}:=\gamma(\lambda^{*})\big{(}T_{k}^{(v)}-k/v^{*}\big{)}-\frac{3k}{2N}\log N, and let be its analogue when is replaced by . Also set \Phi_{k,N}(z)=z+h\big{(}k\wedge(N-k)\big{)}. By a simple union bound and the Many-to-One Lemma (Lemma 2.1), one has
[TABLE]
Observe that for some deterministic function , so by Remark 2.4 we may apply the change of measure in Lemma 2.3 to deduce
[TABLE]
for some constant ; this last inequality follows since and is uniformly bounded. It is straightforward to see that
[TABLE]
and so we are left with bounding
[TABLE]
Notice that is precisely equal to when , so we may apply (2.15) of Lemma 2.8 to deduce
[TABLE]
for . Notice this bound remains true if we multiply the right hand side by provided . If either or , we instead use a local central limit theorem to write
[TABLE]
for suitable . Combining the preceding two displays with (3.5) and plugging into (3.4), we find
[TABLE]
Plugging into (3.3) and summing over , we deduce (3.2) and complete the proof. ∎
Our main application of Lemma 3.1 in this section is the following.
Corollary 3.3**.**
There exist such that for all , and ,
[TABLE]
Proof.
Fix . If , one can use a simple first moment estimate (without barrier) to obtain stronger results, so assume . Let . Observe that
[TABLE]
Moreover, for some constant . The latter of these inequalities follows since and hence for sufficiently large . Thus, using , we deduce
[TABLE]
Hence,
[TABLE]
and the result follows from Lemma 3.1. ∎
We also require a complementary lower bound, for which we use a second moment method.
Lemma 3.4**.**
There exists a constant such that for all , , and ,
[TABLE]
Proof.
Define the random variable
[TABLE]
An application of Cauchy-Schwarz yields
[TABLE]
Applying the Many-to-One Lemma (Lemma 2.1), Lemma 2.3, and (2.21) of Lemma 2.9, one obtains
[TABLE]
(Note that the boundedness of and , and the equality , were also used.) To get an upper bound on \mathbb{E}^{x}\big{[}Z_{t,y}^{2}\big{]}, we first apply the Many-to-Two Lemma (Lemma 2.2) to write
[TABLE]
For given and , one can repeat the steps in (3.9), replacing the lower bound (2.21) with the analogous upper bound (2.20), to obtain
[TABLE]
Plugging this into the previous display, splitting the inner region of integration into , and using the boundedness of , we find
[TABLE]
Applying the same argument as (3.10) to this final expectation, we deduce
[TABLE]
where for was used in the second step. Combined with (3.8) and (3.9), this implies (3.7) and completes the proof. ∎
We end this subsection with the following, which is an obvious consequence of Corollary 3.3 and Lemma 3.4, but will nonetheless be useful to state.
Corollary 3.5**.**
There exist constants such that for all , , and ,
[TABLE]
and for all , , and ,
[TABLE]
Both (3.12) and (3.13) remain true if is replaced by for some .
3.2. Exact asymptotics
In this subsection, we obtain estimates for as followed by . We are primarily concerned with the following.
Proposition 3.6**.**
There exists a positive, continuous, -periodic function such that
[TABLE]
To prove this, we will first need to compare the probability of with a suitable expectation, and then use the sharp result (2.17) of Lemma 2.8 to find the limiting behavior of this expectation.
In what follows, we will consider satisfying
[TABLE]
and define the following events:
[TABLE]
where and as in Lemma 3.1. Note that, for a suitable choice of constant , one has
[TABLE]
if and is sufficiently large. To see this, observe first by Taylor expansion that
[TABLE]
and so
[TABLE]
Hence, on , for and , one has
[TABLE]
and on , for one has
[TABLE]
Now, for alive before time , let be the maximum of over which are descendants of . We define
[TABLE]
Our first step in proving Proposition 3.6 is the following.
Lemma 3.7**.**
One has
[TABLE]
In order to prove Lemma 3.7, we first show that the expectations of and are asymptotically equivalent. We are then able to use Lemma 3.1 and a second moment argument to obtain upper and lower bounds, respectively.
Lemma 3.8**.**
One has
[TABLE]
Proof.
By Lemma 2.1, we have
[TABLE]
where (respectively, ) is the analogue of (respectively, ) when is replaced by , and
[TABLE]
Applying Lemma 2.3, we have
[TABLE]
where \zeta_{t,y}:=\lambda^{*}\big{(}u+\{m_{t}+y-u\}\big{)}+\frac{3}{2}\log\frac{t}{N} and is the analogue of when is replaced by ; recall that when .
We split the integral on the right hand side of (3.20) into the regions , , and . For the first and third of these, we ignore the term altogether and write
[TABLE]
by (2.19) of Lemma 2.8. Moreover, observe that
[TABLE]
and hence
[TABLE]
by (3.12) of Corollary 3.5. Combining these two estimates, we see that the integral of the right hand side of (3.20) is bounded by
[TABLE]
in the region , and by
[TABLE]
in the region .
In the region , we note that the integrand is bounded and Lipschitz (since is a differentiable function of ), and so satisfies (2.14); hence, by (2.18) and (2.17) of Lemma 2.8, we have
[TABLE]
for sufficiently large , where as . Plugging (3.22)–(3.24) into (3.20), we deduce
[TABLE]
for sufficiently large. To complete the proof, it thus suffices to show
[TABLE]
But this is straightforward – using the same steps that led to (3.20), we have
[TABLE]
so restricting to the interval and applying (2.16) of Lemma 2.8 and (3.13) of Corollary 3.5 (in analogue to the computation in (3.21)), we deduce
[TABLE]
demonstrating (3.25) and completing the proof. ∎
Since (3.16) implies that we have for sufficiently large , Lemma 3.8 implies that all three expectations are asymptotically equivalent. This allows us to find an upper bound of \mathbb{P}^{x}\Big{(}M_{t}>m_{t}+y\Big{)} of the form \big{(}1+o(1)\big{)}\mathbb{E}^{x}\big{[}\Lambda_{t,y}\big{]}. In order to find a corresponding lower bound, we use a second moment method. The second moment is controlled in the following Lemma.
Lemma 3.9**.**
One has
[TABLE]
Proof.
Throughout, we abbreviate . By the Many-to-Two Lemma
(Lemma 2.2), we have
[TABLE]
We now bound this last expectation, which we abbreviate as . For , one applies the Many-to-One Lemma (Lemma 2.1) followed by Lemma 2.3 to find
[TABLE]
As in the steps leading to (3.21), we apply (3.12) of Corollary 3.5 to find
[TABLE]
Plugging this into the above display and applying (2.15) of Lemma 2.8 (noting, as in the proof of Lemma 3.4, that with ), we have
[TABLE]
where . By splitting the sum into and , one sees that it is bounded by . Plugging this bound back into (3.28), we have
[TABLE]
where the last line follows since . Now using the same steps as in the analogous calculation in Lemma 3.4, one has
[TABLE]
and so plugging this back into (3.29), we deduce
[TABLE]
Finally, by (3.25), we have
[TABLE]
and so it follows that
[TABLE]
implying (3.27) and completing the proof ∎
With Lemmas 3.8 and 3.9, we are able to prove Lemma 3.7.
Proof of Lemma 3.7.
Observe that
[TABLE]
where is as in Lemma 3.1. Applying this Lemma along with (3.25), one has
[TABLE]
where we also used . Thus, by Lemma 3.8 we have
[TABLE]
For the lower bound, we have
[TABLE]
and so by Lemma 3.9 we have
[TABLE]
Combining (3.30) and (3.31) yields (3.17), completing the proof. ∎
With Lemma 3.7 at our disposal, we may proceed with the proof of Proposition 3.6.
Proof of Proposition 3.6.
Recall from (3.26) that
[TABLE]
where . The idea now is to let followed by in such a way that and are fixed. To that end, for , let
[TABLE]
and
[TABLE]
So as to not burden the notation, we will usually suppress the dependence on and , but we must careful to note that each convergence is uniform in and .
Observe along these sequences, one has
[TABLE]
with the convergence being uniform in and . Moreover,
[TABLE]
is a positive, bounded, Lipschitz function on , with upper bound and Lipschitz constant independent of and , but possibly depending on . Thus, by (2.17) of Lemma 2.8, we have
[TABLE]
uniformly in , and . In particular, since as uniformly in , this implies
[TABLE]
as followed by along the sequences , , and the convergence is uniform in , and . Hence, by Lemma 3.7, we have
[TABLE]
Notice, however, that the first term does not depend on at all, whereas the only dependence the second term has on is in its dependence on . Thus, by taking different satisfying (3.15), we see that
[TABLE]
and hence there exists such that , uniformly in and .
To see that is continuous and -periodic, observe that is -periodic in and continuous except possibly at points for which is an integer; for fixed , , one can let along points at which is not an integer for any , and then since the convergence is uniform one sees that is continuous on . The positivity of then follows from Lemma 3.4, completing the proof. ∎
4. Proof of the Main Results
With Proposition 3.6 at our disposal, Theorem 1 follows by a standard cutting argument.
Proof of Theorem 1.
We will show a slightly more general version, namely that there exists a positive random variable such that
[TABLE]
where is the function in Proposition 3.6.
Let \Phi^{x}_{s}(z):=\mathbb{P}^{x}\Big{(}M_{s}-x>m_{s}+z\Big{)}. For , we have
[TABLE]
where . Define also . Consider the event
[TABLE]
an application of Corollary 3.4 shows that
[TABLE]
Now fix . By a Taylor expansion, there exists such that
[TABLE]
whenever . By Corollary 3.3 and Proposition 3.6, there exists such that
[TABLE]
for all and . Plugging the previous two displays into (4.2), we find that, for all and each ,
[TABLE]
and
[TABLE]
where is defined in the proof of Proposition 3.6, and
[TABLE]
Combining (4.4) and (4.5), and noting also the inequality
[TABLE]
we deduce that
[TABLE]
uniformly in and , and in particular both limits exist. Since is continuous and , , one has that \mathbb{E}^{x}\big{[}e^{-\eta\Theta_{s}\mathbbm{1}_{A_{s}}}\big{]} converges for all , and hence by a standard argument that
[TABLE]
for some non-negative random variable (recall that and are defined in (4.3) and (4.6)). Thus, we have shown
[TABLE]
uniformly in and . Finally, since is continuous, the right hand side of (4.8) is a continuous function of , and thus the convergence is also uniform in . This completes the proof. ∎
With (4.1), Corollary 2 follows easily.
Proof of Corollary 2.
Recall that, if solves the F-KPP equation in a periodic medium as given in (1.8) then
[TABLE]
Since is also a Branching Brownian Motion (with branching rates given by the function , which does not change the eigenvalue in (1.6), and hence does not change or ), one can apply the general form (4.1) or Theorem 1 to deduce
[TABLE]
where and are the analogues of and , respectively, for the Branching Brownian Motion . In particular, using the change of variables , we find
[TABLE]
where
[TABLE]
One can note in the proof of Theorem 1 that has the same law under as under , and so the same is true for , and hence also . It follows that satisfies , completing the proof. ∎
5. Extensions
This problem can be extended in a number of possible directions. In this section, we briefly explore two of these possibilities: the case where the inhomogeneity is not just in the branching rate, but also in the offspring distribution and the underlying dynamics of each particle; and the analogous discrete version of this latter case, that is, a Branching Random Walk with spatially dependent offspring distribution.
We note that, throughout this section, we will define measure , , and . Much like in our main text, we will omit the superscript when .
5.1. Spacial dependence on offspring distribution and underlying dynamics
Theorem 1 can be substantially generalized without dramatically changing the proof. Specifically, while we have considered a periodic branching rate, the offspring distribution (in this case, binary branching) and underlying dynamics (Brownian motion) are not spatially dependent. In this subsection, we consider a generalization of our problem where all of these factors are allowed to depend on space in a periodic manner.
Let be a process under the probability measure with dynamics
[TABLE]
where and are -periodic functions, with , and is a standard Brownian motion. Additionally, let be a positive, -periodic function, and for each , let be a distribution on such that , its first and second moments and are bounded functions of , and is a -periodic function for each .
Under the measure , let be a Branching process with branching rate , offspring distribution , and underlying dynamics given by (5.1). As before, we define
[TABLE]
The statement of our extension is similar to Theorem , but we will need a new eigenvalue equation to find and . Specifically, let and be the respective principal eigenvalue and positive eigenfunction of the equation
[TABLE]
normalized so .
By integrating (5.2) over a single period, it is clear that
[TABLE]
where and are the respective minimum and maximum of the function x\mapsto\big{(}\rho(x)-1\big{)}g(x). It thus follows that both as and as , and hence
[TABLE]
exists. (Note that the uniqueness of follows, as in Lemma 2.5, from the analyticity of .) As in our main text, we then define .
The analogue of Theorem 1 holds in this setting provided . Explicitly, we have the following.
Theorem 5.1**.**
Assume . Then there exist a random variable and a positive, continuous, -periodic function such that
[TABLE]
for all .
Let us briefly state how this would be proved. The Many-to-One and Many-to-Two lemmas in this case say
[TABLE]
and
[TABLE]
with analogous statments holding on stopping lines.
As we did earlier, we then define
[TABLE]
We wish to change measure analogously to Lemma 2.3, but since is not necessarily a martingale, we must be slightly careful. First, note that for fixed ,
[TABLE]
is a martingale, and its quadratic variation is
[TABLE]
Since and are both bounded, for all , and so satisfies Novikov’s condition. Thus, its Doléans-Dade exponential
[TABLE]
is a positive martingale. Define the measure by
[TABLE]
where is the natural filtration of . Then by Girsanov’s theorem, under , has dynamics
[TABLE]
where we also used
[TABLE]
Moreover, one can show by (5.2) and the definition of that
[TABLE]
from which it follows, by the same argument as Lemma 2.3, that
[TABLE]
Now, one can once again show that, under , satisfies a large deviations principle with good, convex rate function
[TABLE]
and so in particular, if and only if . One can then show , -almost surely. From here, the same stopping time argument will then work, since if is the first time for to reach , then under , is a sum of IIDs with exponential moments in a neighborhood of the origin.
We remark that we believe this argument should be able to be adapted to the case . In this case, rather than the stopping times , one considers , where is the first time that hits . While many of the preliminary estimates will be the same, the stopping line argument in Section must be changed – the majority of particles will hit before the maximum does, and so one would need to instead consider , the first time after at which hits . Of course, this is no longer a sum of IIDs, so after applying the Many-to-Few lemma and the change of measure, one must decompose events based on whether or not . We leave the details to the reader.
We also note that the case is a peculiarity, because now this method will certainly not work, but we have no reason to believe the result will not be true. Indeed, from the outset, we could have chosen to approach the problem by developing barrier estimates on (in the main text, ) under directly. First, one would need a local central limit theorem to estimate
[TABLE]
which can be done with mostly functional analytic methods. This is followed by two local central limit theorems with barrier to estimate
[TABLE]
first for of order , then for in a compact set; see [11] for a version of these arguments for an additive functional of a finite Markov chain. Note that, since the drift and volatility of are spatially-dependent, one should expect an additional term in each estimate corresponding to the invariant distribution of the fractional part of , which will not be uniform.
We end this subsection by stating the analogue of Corollary 2 under this setting.
Corollary 5.2**.**
Let be the solution to the equation
[TABLE]
where
[TABLE]
and let . There exists a function , satisfying , such that
[TABLE]
5.2. Branching Random Walk
Finally, we consider a discrete analogue of Theorem 5.1. Note that the concept of a branching rate here is not necessary – any step where a particle does not branch is indistinguishable from the particle having exactly one child. We also restrict our attention to the case where the underlying dynamics consist of particles which either do not move, or move one position to the left or right. This is so that, like in the continuous case, a particle must hit before it hits , allowing us to use our stopping time analysis.
Consider a Markov chain on under the probability measure , with initial position and kernel satisfying, for all , for some integer and if . For each , let be a distribution on such that , its first and second moments and are bounded functions of which are greater than , and is an -periodic function for each .
We then consider the following Branching Random Walk under the measure : we begin with a single particle at position ; at generation , we have a collection of particles , where has position , and then at step gives birth to a random number of particles given by the distribution , and each of these particles then makes a jump according to the kernel , independently of all other particles in generation . As in the case of Branching Brownian Motion, we are interested in the maximum
[TABLE]
at time . We anticipate the maximum to be located near for some constants . To identify the speed and logarithmic correction, we once again require an eigenvalue equation. In this case, let \mathcal{X}:=\big{\{}h\in\mathbb{R}^{\mathbb{Z}}:h(\cdot+L)=h\big{\}} and consider the operator on defined by
[TABLE]
Note that is a strictly positive operator on the finite dimensional space , so by the Perron-Frobenius theorem it has a principal eigenvalue and positive eigenvector , normalized so that . Once again, by [16], these are analytic functions of .
Let , and assume
[TABLE]
exists. Unlike the continuous case, the existence of a minimizer is not necessarily true; indeed, the case with binary branching and has no minimizer. (Roughly speaking, the minimizer will exist provided the branching is sufficiently slow.) The uniqueness of is automatic, however; as in Lemma 2.5, this follows from the analyticity of .
With , our main result is then the following.
Theorem 5.3**.**
Assume . There exists a random variable and a positive, -periodic function on such that
[TABLE]
The proof follows the same basic outline as that of Theorem 1. Much like in the previous subsection, the Many-to-Few lemmas and change of measure require more explanation. First, note that the Many-to-One and Many-to-Two lemmas in this context are
[TABLE]
and
[TABLE]
with analogous statements holding on appropriate stopping lines. Now note that, by definition of and ,
[TABLE]
is an -periodic kernel on which is positive precisely when is; if is the probability measure corresponding to the Markov chain starting at and having kernel , then
[TABLE]
where is the natural filtration of . Once again, under , satisfies a large deviations principle with good, convex rate function
[TABLE]
which is zero if and only if . This immediately implies (by the Borel-Cantelli lemma) that , -almost surely. We then define the stopping times
[TABLE]
observing that under , are IID with distribution equal to that of under , which has mean and possesses finite exponential moments in a neighborhood of the origin.
From here, the proof proceeds much as it does for Theorem 1 or Theorem 5.1. However, there is one more important difference: the random walk is lattice. Because of this, we end up with a version of Proposition 3.6 where is replaced by , the unique element of . To prove this, one must replace by in the the definition of , and then in the definition of replace by , with uniformly bounded, such that is integer valued. This allows us to apply the lattice version of Lemma 2.8 when estimating E^{x}\big{[}\Lambda_{t,y}\big{]} – see [7, Section ] for details.
We finally note that, as in the continuous case, we could have approached this problem directly, rather than using stopping times. We believe this should give superior results, enabling us to handle any n, and also allowing us to handle the case where is not restricted to nearest neighbor jumps. Since one can always write as an additive functional of a finite Markov chain, the estimates in [11] may be used instead of Lemma 2.8, at least if is non-lattice. We leave this to future work.
Appendix A
In this short appendix, we provide the proof of Lemma 2.8. When and , the lemma is almost precisely Lemmas and of [7], with the following minor modifications.
- (1)
In [7], the statements were not in terms of the measure but instead for the measure under which . However, the proof first shows the statements for , and then shows that the Radon-Nikodym derivative between the two converges to as . 2. (2)
In [7], the analogue of (2.17) is written less explicitly as a function of and . However, examining the proof reveals the form of this function as stated. 3. (3)
Because [7] deals also with increments whose law does not possess a density, restrictions on the sign of the sequence are imposed there (see the proof of [7, Corollary A.3], which is a key step in the proof of the lemmas there, for where the sign restriction is used explicitly). This is irrelevant in our setup, and hence this restriction is omitted.
We now proceed to the proof of Lemma 2.8, for or general . Heuristically, when reaches for the first time, it “resets” and we may apply the result in its original version, with replacing . Given we assume is quite regular, its appearance does not add much complication to the proofs.
By the strong Markov property, one has
[TABLE]
Along with the case and the inequalities
[TABLE]
and
[TABLE]
this implies (2.15) and (2.16) (taking ).
Similarly, multiplying (A.1) by , letting , and using the bounded convergence theorem, we obtain (2.17) for . To prove this for satisfying (2.14), observe that for , if we set ,
[TABLE]
where is the Lipschitz constant of . Multiplying by and letting , we see
[TABLE]
However, we also have
[TABLE]
and hence
[TABLE]
for any , which implies (2.17).
Repeating the same procedure as above for (2.18) allows us to prove the case , satisfying (2.14) from the case , . For general , we use the strong Markov property to write the left hand side of (2.18) as
[TABLE]
(Note that the integral should really begin from , not zero, but since , \sup_{x\in[0,1)}\mathbf{P}_{\lambda^{*}}^{x}\Big{(}y+y^{1/10}+S_{1}^{(N)}\leq 0\Big{)}=0 for sufficiently large , and thus the integral over this region vanishes.)
Since is concave and increasing, there exists such that for all . Letting , one can show that for all , and hence
[TABLE]
for all . Thus, we may bound (A.2) above by
[TABLE]
Multiplying the above display by and letting , we see that the left hand side of (2.18) is no more than
[TABLE]
where is the analogue of when is replaced by , and this is in turn is bounded above by
[TABLE]
where
[TABLE]
Since as , it follows that as , and thus (2.18) follows.
Finally, we prove (2.19). For , this is a straightforward consequence of (2.18) and (2.17). For , define and . We recall from [7, equation ] the inequality
[TABLE]
which implies
[TABLE]
Since , one can show for a constant which depends on and , but not on or . Thus, (2.19) follows by applying the case to the above inequality. This completes the proof. ∎
Acknowledgment
E.L. was supported in part by NSF grant DMS-1812095. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 692452), and from a US-Israel BSF grant.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Aïdékon. Convergence in law of the minimum of a branching random walk. Annals Probab. , 41:1362–1426, 2013.
- 2[2] H. Berestycki and F. Hamel. Front propagation in periodic excitable media. Comm. Pure Appl. Math. , 55(8):949–1032, 2002.
- 3[3] H. Berestycki, F. Hamel, and N. Nadirashvili. The speed of propagation for KPP type problems. I. Periodic framework. J. Eur. Math. Soc. (JEMS) , 7(2):173–213, 2005.
- 4[4] H. Berestycki, F. Hamel, and L. Roques. Équations de réaction-diffusion et modèles d’invasions biologiques dans les milieux périodiques. C. R. Math. Acad. Sci. Paris , 339(8):549–554, 2004.
- 5[5] A. Bovier. Gaussian processes on trees: From spin glasses to branching Brownian motion , volume 163 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 2017.
- 6[6] M. Bramson. Convergence of solutions of the Kolmogorov equation to travelling waves. Mem. Amer. Math. Soc. , 44(285):iv+190, 1983.
- 7[7] M. Bramson, J. Ding, and O. Zeitouni. Convergence in law of the maximum of nonlattice branching random walk. Ann. Inst. Henri Poincaré Probab. Stat. , 52(4):1897–1924, 2016.
- 8[8] M. D. Bramson. Maximal displacement of branching Brownian motion. Comm. Pure Appl. Math. , 31(5):531–581, 1978.
