Abstract
We study asymptotics of the free energy for the directed polymer in random environment. The polymer is allowed to make unbounded jumps and the environment is given by Bernoulli variables. We first establish the existence and continuity of the free energy including the negative infinity value of the coupling constant \(\beta \). Our proof of existence at \(\beta =-\infty \) differs from existing ones in that it avoids the direct use of subadditivity. Secondly, we identify the asymptotics of the free energy at \(\beta =-\infty \) in the limit of the success probability of the Bernoulli variables tending to one. It is described by using the so-called time constant of a certain directed first passage percolation. Our proof relies on a certain continuity property of the time constant, which is of independent interest.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and Main Results
The directed polymer in random environment is a statistical physics model of a polymer in disordered solvent. In the discrete set-up, the polymer chain is a random walk \(((X_n)_{n\ge 0}, P)\) on \(\mathbb {Z}^d\) starting at the origin and the random environment is modelled by independent and identically distributed random variables \(((\eta (j,x))_{(j,x)\in \mathbb {N}\times \mathbb {Z}^d}, Q)\). We introduce the Hamiltonian \(H_n^\eta =\sum _{j=1}^n\eta (j,X_j)\) and, for a given inverse temperature \(\beta \in \mathbb {R}\), define the finite volume Gibbs measure by
where \(Z_n^{\eta ,\beta }=P[\exp \{\beta H_n^\eta \}]\) is the partition function with \(P[\cdot ]\) denoting the expectation with respect to P. When \(\beta >0\), the polymer is attracted by large values of \(\eta \) and repelled by negative values. It is known that this interaction causes a localization transition depending on the law of the random walk [10].
A quantity of particular importance in this model is the free energy
whose existence is usually established by a subadditivity argument. It is for instance believed that the difference between \(\varphi (\beta )\) and the so-called annealed free energy characterizes the localized/delocalized phases. See [3, 6, 8, 11] for rigorous results in this direction.
1.1 Zero Temperature Limits and Open Paths Counting
One of the main results in the present article is about the zero temperature limit of the free energy \(\varphi (\beta )\). Let us give a few words on the motivation. There has recently been a revival of interest in the problem concerning the number of extremal paths in random media that dates back to [17, 20], see for example [7, 18, 19, 25, 26, 32] for recent works in the directed setup. Among others, Garet–Gouéré–Marchand [19] have recently established the existence of the growth rate of the number of open paths in nearest neighbor oriented percolation. To be more precise, let \(N_n\) be a number of open paths of length n starting from \((0,0)\in \mathbb {N}\times \mathbb {Z}^d\). Then assuming that the percolation takes place with a positive probability, it is proved that \(\lim _{n\rightarrow \infty }n^{-1}\log N_n\) exists and is non-random on the event of percolation. The main difficulty is that the standard subadditivity argument does not work as \(\log N_n\) is not well-defined (or should be defined as \(-\infty \)) with positive probability, making this quantity not integrable. One of the motivations of the present work is to propose an approach to the same problem by considering the zero temperature limit of the directed polymer model. Indeed, when the random walk is simple nearest neighbor walk and \(\eta \) is a Bernoulli variable, the above partition function at \(\beta =-\infty \) coincides with \((2d)^{-n}N_n\). If we are able to prove that the convergence
is uniform in n on the event of percolation, then it follows that \(\lim _{n\rightarrow \infty }n^{-1}\log N_n\) exists and is equal to \(\lim _{\beta \rightarrow -\infty }\varphi (\beta )+\log 2d\). In this paper, we carry out this program for random walks with stretched-exponential transition probabilities as a test case. The unboundedness of jumps simplifies the problem since no percolation transition occurs anymore. However we note that our approach automatically yields the stronger continuity result of the free energy at \(\beta =-\infty \). One of the reasons for our rather special choice of the transition probability is that with this choice, the model has a relation to a directed version of the first passage percolation studied in [21, 22], which is interesting in its own right. See Theorem 1.3 below.
We shall comment more on related works in Sect. 1.3 after describing our setting and results.
1.2 Setting and Results
Let \((\{X_n\}_{n\in \mathbb {N}}, P_x)\) be the random walk on \(\mathbb {Z}^d\) starting from x and with the transition probability
where \(f:\mathbb {N}\cup \{0\}\rightarrow (0,1)\) is a function of the form
We write P instead of \(P_0\) for simplicity.
Remark 1.1
Our choice of the jump law is somewhat arbitrary, and it is tempting to replace our specific choice with some regular variation assumption on the tail of \(\log f(k)\). It is a purely technical exercise to adapt our method in order to cover such cases. To make arguments as transparent as possible we stick to this simple law.
In view of the motivation explained above, we assume that \((\{\eta (j,x)\}_{(j,x)\in \mathbb {N}\times \mathbb {Z}^d}, Q)\) is independent and identically distributed Bernoulli random variables with
We define the partition functions at \(\beta =-\infty \) by
in addition to the notation introduced before. Note that \(Z_n^{\eta ,-\infty }\) is positive for Q-almost every \(\eta \), since the random walk has unbounded jumps. It is routine to show that, Q-almost surely and for all \(\beta \in \mathbb {R}\), the free energy exists and is equal to the second line:
Then, it is plain to see that \(\varphi \) is non-decreasing in p for \(\beta >0\), non-increasing in p for \(\beta <0\), non-decreasing and convex in \(\beta \), and that \({\varphi }(p,\beta )={\varphi }(1-p,-\beta )+\beta \) for \(\beta \) real. Furthermore, one can show by a simple application of the so-called block argument that
See Appendix for a proof. Our first result shows that the free energy exists and is jointly continuous in \((p,\beta )\), including \(\beta =-\infty \).
Theorem 1.2
In the above setting with \(\alpha \in (0,d)\), the limit
exists Q-almost surely. Moreover, the function \(\varphi (p,\beta )\) is jointly continuous on \((0,1]\times [-\infty ,\infty )\setminus \{(1,-\infty )\}\).
It is possible to show the first part for general \(\alpha \in (0,\infty )\) by using the subadditive ergodic theorem, as in the proof of Theorem 2.1 of [15], with the help of the fact that
However, we prove it as a part of the proof of continuity result, avoiding direct use of the subadditive ergodic theorem at \(\beta =-\infty \). As explained above, we think this is of technical importance. Note that the above integrability condition may break down even for a model where there is no percolation transition. The Brownian directed polymer in Poissonian medium with \(\beta =-\infty \) is such an example, as one can easily check by considering the event that there is a Poissonian trap very close to the origin.
Note that at the exceptional point in Theorem 1.2, \(\varphi \) should be defined as \(\varphi (1,-\infty )=-\infty \). It is then natural to ask how \(\varphi (p,\beta )\) grows as \((p,\beta )\rightarrow (1,-\infty )\). Our next result addresses a directional asymptotics. Note that \(\varphi (\beta , p)\) exists Q-a.s. for all \(\alpha >0\), as we have just mentioned.
Theorem 1.3
In the above setting with \(\alpha \in (0,\infty )\), there exists a constant \(\mu _1>0\) such that as \(p \uparrow 1\),
The constant \(c_2\) comes from (2), and \(\mu _1\) is defined by (7) with \(p=1\).
Remark 1.4
If we replace \(\eta \) by \(1-\eta \) and denote the corresponding free energy by \(\tilde{\varphi }(p,\beta )\), we can deduce its asymptotics as \(\beta \rightarrow +\infty \) and \(p\downarrow 0\) from Theorem 1.2 and 1.3 as follows:
This kind of symptotics are extensively studied in the continuous time setting, see Sect. 1.3 below. In the discrete time setting, however, this is the first result in the same direction to the best of our knowledge — possibly because for the common nearest neighbor walk model, the high density asymptotics at \(\beta =-\infty \) is trivial. Moreover, we encounter a new directed first passage percolation model in identifying the constant \(\mu _1\) which is interesting in its own right. Let us explain how it comes into play.
The asymptotics (5) has a simple heuristic interpretation. When p is close to 1, the sites at which \(\eta =0\) have low density \(1-p\) and hence the random walk has to make a jump of order \((1-p)^{-1/d}\) at each step to achieve \(H_n^\eta =0\). The probability of such a path decays like \(\exp \{-(1-p)^{-\alpha /d}n\}\) and this explains the p-dependent factor. In fact, it turns out that the main contribution to the free energy comes from the path which carries the highest probability and hence the constant \(c_2\mu _1\) corresponds to the growth rate of the minimal cost for the random walk.
Note that this minimal cost could in principle depend on p, but actually it does not, as we will see in the next theorem. There, we prove the continuity as \(p \uparrow 1\) of the time constant of a certain directed first passage percolation, a result of independent interest. Denote the (scaled) points where the random walk is allowed to go by
with the natural scaling factor \(s_p=(\log \frac{1}{p})^{1/d}\sim (1-p)^{1/d}\) (\(p\uparrow 1\)). With some abuse of notation we will frequently identify \(\omega _p\), and more generally any point measure, with its support. Given a realization of \(\omega _p\), we define the passage time from 0 to n by
Then, a direct application of the subadditive ergodic theorem shows that the limit
exists Q-almost surely. The limit \(\mu _p\), so-called time constant, is deterministic. In these terms, the maximal probability of paths satisfying \(H_n^\eta =0\) is expressed as
Now note that \(\omega _p\) converges as \(p\uparrow 1\) to the Poisson point process \(\omega _1\) on \(\mathbb {N}\times \mathbb {R}^d\) whose intensity is the product of the counting measure and Lebesgue measure. Observe also that definition (6) makes perfect sense when \(p=1\), yielding a limit \(\mu _1\) in (7). In the next result we claim that the time constant of the Bernoulli model converges to that of the Poisson model as \(p \uparrow 1\).
Theorem 1.5
(Continuity of the time constant) We have
Remark 1.6
A similar continuity of the time constant is known for lattice first passage percolation in greater generality, see [12, 13] and (6.9) in [24].
1.3 Related Works
The main part of Theorem 1.2 is the continuity of \(\varphi (p,\beta )\) around \(\beta =-\infty \), which is the zero temperature asymptotic result for the free energy. This type of problems does not seem to attract much interest in the discrete time setting since in some cases the answers are simple. For instance, consider the (nearest-neighbor) simple random walk model with an i.i.d. random environment with \(Q(\eta (0,0)>0)>0\). Then it is easy to see that as \(\beta \rightarrow +\infty \), the free energy is asymptotic to \(\beta \) times the time constant of the directed last passage percolation. However, if \(\eta \) is Bernoulli distributed and we send \(\beta \rightarrow -\infty \), the situation is not so simple. As we mentioned at the beginning, the existence of \(\varphi (-\infty )\) proved in [19] is already highly nontrivial and the continuity as \(\beta \rightarrow -\infty \) remains an open question at the moment.
For the continuous time polymer models, the asymptotics of the free energy is far from being simple. Continuous time random walk models, known under the name of parabolic Anderson model, have attracted enormous attention. Carmona–Molchanov in the seminal work [5] initiated this line of research. They mainly studied the case when the environment is a space–time Gaussian white noise and their results include non-matching upper and lower bounds for the free energy when the jump rate of the random walk tends to zero. Note that this limit is similar to that in Theorem 1.3 in spirit since in both cases, the random walk is forced to make more jumps than it typically does. Shiga [31] proved similar results for the space–time Poissonian environment at \(\beta =-\infty \). In fact, both [5] and [31] only proved the existence of the free energy in the sense of a \(L^1\) limit. These results were later refined and extended in [14–16, 28] and almost sure existence of the free energy was established in [15, 16]. Finally, the sharp equivalent for the free energy as the jump rate vanishes was obtained in [4, 15] in terms of the time constant of a last passage percolation problem. Note that for the Gaussian white noise environment, the above asymptotics is readily translated to the \(\beta \rightarrow \pm \infty \) limit by using a scaling identity (see Chapter IV of [5]). On the other hand, in the Poissonian environment case, these zero temperature limits are of independent interest but have not been considered yet. In particular, we expect that the continuity similar to Theorem 1.2 holds when \(\beta \rightarrow -\infty \).
Another continuous time polymer model is Brownian directed polymer in Poissonian environment introduced by Comets–Yoshida [9]. The \(\beta \rightarrow +\infty \) limit was studied in the same paper, as well as \(\beta \rightarrow -\infty \) for \(d\ge 3\) with a specific choice of the other parameters. It is possible to show by a block argument that the finite volume free energy stays bounded as \(\beta \rightarrow -\infty \) in general but, to the best of our knowledge, the existence of the limit at \(\beta =-\infty \) is not known. Later in [11], the asymptotics as the density of the Poisson point process tends to \(\infty \) was also studied but only for bounded \(\beta \), in contrast to Theorem 1.3 here.
Finally, we mention that some solvable models have been found recently, see, e.g., Moriarty–O’Connell [27], Amir–Corwin–Quastel [1] and Seppäläinen [30]. In these models the free energy can be explicitly computed, thus allowing to study various asymptotics. But we refrain from explaining the details of these results since such examples have been found only in \((1+1)\)-dimension so far and also the techniques employed are quite different from ours.
1.4 Organization of the Paper
The rest of the paper is organized as follows. Section 2 is devoted to the proof of Theorem 1.2. For \(\beta \in \mathbb {R}\), the continuity is relatively easy and the essential part is the proof of continuity around \(\beta =-\infty \). The basic strategy is to introduce a deformation of the path with a quantitative control of the resulting error. In Section 3, we prove Theorem 1.5, as well as a concentration result which is used in the proof of Theorem 1.3. Finally, we prove Theorem 1.3 in Section 4, by showing that the heuristic computation given below Remark 1.4 is indeed correct. There, we closely follow arguments of Mountford [28].
2 Proof of Theorem 1.2
Proof
(Theorem 1.2 ) Note first that continuity in \(\beta \in (-\infty ,\infty )\) follows from convexity of \(\varphi (p,\cdot )\). Next, we verify the continuity in p, locally uniformly in \(\beta \), cf. (8) below. For this purpose, we take arbitrary \(0<p<q \le 1\), and introduce another family of independent and identically distributed Bernoulli variables \((\{\zeta (j,x)\}_{(j,x)\in \mathbb {N}\times \mathbb {Z}^d}, Q')\) with \(Q'(\zeta (0,0)=1)=(q-p)/(1-p)\) and define \(\check{\eta }=\eta \vee \zeta \). Then, \((\{\check{\eta }(j,x)\}_{(j,x)\in \mathbb {N}\times \mathbb {Z}^d},Q\otimes Q')\) is a collection of Bernoulli random variables with success probability q and we are going to estimate
where \(\mathrm{{d}}\mu _n^{\eta ,\beta }=(Z_n^{\eta ,\beta })^{-1} \exp \{\beta H_n^{\eta }\}\mathrm{{d}}P\) is the polymer measure. For positive \(\beta \), we have by Jensen’s inequality that
For negative \(\beta \), we again use Jensen’s inequality for fixed \(\eta \) and \(\zeta \) to get
From these estimates, it follows that for any \(M>0\),
and the same holds for \(\lim _{p\uparrow q}\). Combining with the continuity in \(\beta \), we get the joint continuity on \((p,\beta )\in (0,1]\times \mathbb {R}\).
Now we proceed to the main part of the proof, that is, the continuity at \(\beta =-\infty \). The following is the key estimate.
Proposition 2.1
Let \(\alpha \in (0,d)\), \(p\in (0,1)\) and \(\epsilon >0\). Then there exist \(r>0\) and \(\beta _0<0\) such that for all \(q\in [p,p+r]\) and \(\beta \in [-\infty ,\beta _0]\), Q-almost surely for all sufficiently large n,
Let us first see how to derive Theorem 1.2 from this proposition. Since the other direction \(Z_n^{\eta , \beta }\ge Z_n^{\check{\eta },-\infty }\) is obvious, we see that
This in particular implies (by setting \(q=p\)) that the limit (4) exists and equals to \(\lim _{\beta \rightarrow -\infty }\varphi (p,\beta )\). Thus, (10) reads:
Therefore, it also follows from the monotonicity and (11) that
This, together with (8), completes the proof of the joint continuity. \(\square \)
Proof
(Proposition 2.1 ) Hereafter, we denote \(Q\otimes Q'\) by Q for simplicity. The basic strategy of the proof is to deform the path appearing in the sum
to a path \(x^*\) which does not hit a site with \(\check{\eta }(j,x)=1\) and compare the above with
where the sum runs over all paths which appear as a result of deformation. To establish (9), we need
-
(i)
the deformation costs \(\prod _{j=1}^n\frac{f(|x_{j-1}-x_j|_1)}{f(|x_{j-1}^*-x_j^*|_1)}\) are negligible;
-
(ii)
not too many paths are deformed to a single path \(x^*\).
Let us start the proper proof. We define \(x^*\) as follows:
where if there are several candidates in the second case, we choose one by a deterministic algorithm. To control the costs of deformation, we define
where \({\mathrm{dist}}_1\) denotes the \(l^1\)-distance, and introduce an auxiliary Hamiltonian
for \(\alpha < 1\) and
for \(1 \le \alpha <d\) with the convention \(d_0(X_0,{\check{\eta }})=0\). When \(\alpha <1\), we use the fact \((x+y)^\alpha \le x^\alpha +y^\alpha \) for positive x, y to bound the deformation cost at each step as
In the other case \(1\le \alpha <d\), we instead use convexity to get
Hence in both cases, the total cost is bounded as
for some \(c_3>0\).
Lemma 2.2
Let \(\alpha \in (0,d)\). For any \(p\in (0,1)\) and \(\delta >0\), there exists \(r\in (0,1)\) and \(\beta _0<0\) such that for all \(q\in [p,p+r]\) and \(\beta \le \beta _0\),
Proof
We give a proof only in the case \(1\le \alpha <d\) since the other case is easier. We show that for any \(\gamma >0\), one can find \(\beta _0\) and r such that
for all \(q\in [p,p+r]\) and \(\beta \le \beta _0\). Then it readily follows that Q-almost surely,
except for finitely many \(n \in N\). If we take \(\gamma >\lim _{\beta \rightarrow -\infty }|\varphi (p,\beta )|/\delta \), the right-hand side of
is \(o(Z_n^{\eta ,\beta })\) and we are done.
Let us fix an arbitrary \(\gamma >0\) and we write
with the convention \(|X_n-X_{n+1}|_1=0\). We estimate the last Q-expectation by distinguishing the cases according to the value of \({\check{\eta }}(j,X_j)\). First, if \({\check{\eta }}(j,X_j)=0\) then all terms in the exponential are zero and, by definition,
Second since \(\eta (j,X_j)\) and \(d_j(X_j,{\check{\eta }})\) are conditionally independent on \(\{{\check{\eta }}(j,X_j)=1\}\), we get for general \(\xi >0\),
where \(\delta (\beta ,r)=e^\beta +r\ge e^\beta +Q(\eta (j,X_j)=0, \zeta (j,X_j)=1)\). The upper tail of the distribution of \(d_j(X_j,{\check{\eta }})\) under \(Q(\cdot |{\check{\eta }}(j,X_j)=1)\) is bounded as
As a consequence, we obtain
for some regularly varying function \(\varLambda \) of index \(d/(d-1)\) by a standard Tauberian argument. (See, for example, [23]. In fact, it is easy to check this fact directly by a Laplace principle type argument.) Similarly it also follows from the assumption \(\alpha <d\) that
for some \(\varTheta (\xi )<\infty \).
Now we rewrite the exponential in (15) as
and apply Hölder’s inequality and (16) to obtain
We may drop the first factor on the right-hand side since it can be made smaller than one by letting \(\beta \) be close to \(-\infty \) and r close to zero. We then take the product over \(1\le j\le n\) and P-expectation. Due to the independence of \(\{X_{j-1}-X_j\}_{j=1}^n\) under P, the expectation factorizes and the term containing \(X_{j-1}-X_j\) is
for \(2\le j\le n-1\) and for \(j\in \{1,n\}\), the exponent 2 / 3 is replaced by 1 / 3. In this way, our problem is reduced to checking that
But the function \(x\mapsto \varLambda (3\gamma x^{\alpha -1})\) is regularly varying of index \((\alpha -1)\frac{d}{d-1}<\alpha \) for \(\alpha <d\), hence the above expectation is finite. \(\square \)
Due to the above lemma, we can restrict the summation (12) to paths with \(D_n(x,{\check{\eta }})\le \delta n\) and get
We are left with estimating the number of paths which are deformed to a fixed path.
Lemma 2.3
There exists a function \(\chi (\delta )\rightarrow 0\) as \(\delta \downarrow 0\) such that for any fixed path \((y_1, \ldots , y_n)\in (\mathbb {Z}^d)^n\),
Proof
We write \(z_j=x_j-y_j\). Then it suffices to bound
By taking \(\lambda =\delta ^{-1/2}\), we find that the right-hand side is \((1+o(1))^n\) as \(\delta \downarrow 0\). \(\square \)
Combining the above arguments, we can find \(r\in (0,1)\) and \(\beta _0<0\) such that for any \(q\in [p,p+r]\) and \(\beta <\beta _0\),
for all sufficiently large \(n\in \mathbb {N}\). \(\square \)
3 A Directed First Passage Percolation
In this section, we prove Theorem 1.5. We also prove a concentration bound for the passage times, which is an important ingredient in the proof of Theorem 1.3.
For further use, we start by introducing a special realization of \(\eta \): recalling that \(\eta =\eta _p\) depends in fact on p, we define a coupling of \(\eta _p\) for all values of \(p \in (0,1)\) as follows. Let \((Q, \omega _1)\) be the Poisson point process on \(\mathbb {N}\times \mathbb {R}^d\) whose intensity is the product of the counting measure and Lebesgue measure, and define, for \(p \in (0,1)\),
with \(s_p=(\log \frac{1}{p})^{1/d} \) the scaling factor. Note that \(s_p \in (0,\infty )\) and \(s_p \rightarrow 0\) as \(p \uparrow 1\). Let us also introduce
which vaguely converges to \(\omega _1\), Q-almost surely as \(p \uparrow 1\). Hereafter, we sometimes identify \(\omega _p\) with its support by abuse of notation. For \(0< p \le 1\), recall the definition of the passage time from 0 to n,
and recall that, by the subadditive ergodic theorem, the following limits exist and are equal:
Proof
(Theorem 1.5 ) We have the following comparison for the passage times from which the result readily follows:
where \(\delta _1, \delta _2\rightarrow 0\) as \(p\uparrow 1\). We only prove the first one since the argument for the other is the same. Let \((\pi _n(m))_{m=0}^n\) be a minimizing path for \(T_n(\omega _p)\). Then, by definition, each \(\pi _n(m)+[0,s_p)^d\) contains a point of \(\omega _1\). Thus we can find another path \(\{\pi _n'(m)\}_{m=0}^n\) such that
for \(1\le m\le n\). Then, we have
and together with an elementary inequality
where the second one is obtained by applying convexity to \((\frac{1\cdot t+s\cdot 1}{1+s})^\alpha \), we get
Since \(s_p\) tends to zero as \(p\uparrow 1\), we are done. \(\square \)
Our second main result in this subsection is the lower tail estimate of the passage time distribution.
Proposition 3.1
There exist positive constants \(C_1\), \(C_2\) and \(\lambda \in (0,1)\) such that for any \(n\in \mathbb {N}\),
Proof
We fix a small \(\theta >0\) and define
that is, when we find a large vacant box, we add an \(\omega \)-point artificially at a corner. This modification provides a uniform bound for the passage time
since there is a path whose all jumps are bounded by \(dn^\theta \). We also have the following upper tail estimate.
Lemma 3.2
There exists \(C_0>0\) such that for all \(n\in \mathbb {N}\) and \(m>C_0n\),
Proof
Note that \(T_n(\omega _1)\) is bounded by the passage time of the greedy path \(\{(k,x_k)\}_{k\in \mathbb {N}}\) which is inductively constructed by minimizing the distance to points in the next section, that is, \(x_0=0\) and
The passage time of such a path is nothing but the sum of independent random variables with the same distribution as \(\mathrm{dist}((0,0), \omega _1|_{\{0\}\times \mathbb {R}^d})^\alpha \). One can bound its tail as
for some \(c>0\). Our assertion follows from this and a well known result for the large deviation of sums of independent random variables, for which we refer to [29]. \(\square \)
Next, we show that \(T_n(\omega _1)\) and \(T_n(\bar{\omega }_1)\) are essentially the same.
Lemma 3.3
There exists \(C_3>0\) such that for sufficiently large \(n\in \mathbb {N}\),
Proof
Thanks to Lemma 3.2, we know that \(T_n(\omega _1)\le C_0n\) with probability greater than \(1-\exp \{-n^{1\wedge \frac{d}{\alpha }}/C_0\}\). Under this condition, all the minimizing paths for \(T_n(\omega _1)\) stay inside \({\mathscr {C}}_n:=[0,n]\times [-C_0^{1/\alpha }n^{1+1/\alpha }, C_0^{1/\alpha }n^{1+1/\alpha }]^d\). Indeed, if any minimizing path exits \({\mathscr {C}}_n\), then it must make a jump larger than \(C_0^{1/\alpha }n^{1/\alpha }\) and hence its passage time is larger than \(C_0n\). Since \(T_n(\bar{\omega }_1)\le T_n(\omega _1)\), the same applies to minimizing paths for \(T_n(\bar{\omega }_1)\). This space-time region contains only polynomially many boxes of the form \(\{k\}\times (x+[0,n^\theta )^d)\) and each of them is vacant with probability \(\exp \{-cn^{d\theta }\}\). Thus it follows that
for large n. Since \(T_n( \omega _1)= T_n( \bar{\omega }_1)\) on the event
we get the desired bound on \(Q(T_n(\omega _1)\ne T_n(\bar{\omega }_1))\).
As for the \(L^1(Q)\) distance, we use the Schwarz inequality to obtain
The first factor on the right-hand side is of O(n) as \(n\rightarrow \infty \) due to Lemma 3.2. \(\square \)
We proceed to a lower tail estimate for \(T_n(\bar{\omega }_1)\). Let \(\bar{\omega }_1^{(m)}\) be the point process obtained by replacing its \(\{m\}\times \mathbb {R}^d\)-section by \(\bar{\omega }'\) which is the modification of another configuration \(\omega '\). We are going to use the so-called entropy method (Theorem 6.7 in [2]) and it requires a bound on
Let us first assume \(\alpha \ge 1\) and let \(\{\pi _n(m)\}_{m=0}^n\) be a minimizing path for \(T_n(\bar{\omega }_1)\). As we can find a point in \(\omega '|_{\{m\}\times \mathbb {R}^d}\) within the distance \(dn^\theta \) to \(\pi _n(m)\),
Furthermore, the a priori bound
yields the following bound on the numbers of large jumps
Thus by dividing the sum in (21) according to the indices with jump size falling in \([n^{k\theta }, n^{(k+1)\theta })\), we can bound it, up to a multiplicative constant, by
It is simple to check that the right-hand side is bounded by \(n^{\rho }\) with \(\rho <2\) when \(\theta \) is sufficiently small. Then, Theorem 6.7 in [2] yields
Lemma 3.3 shows that this remains valid with \(\bar{\omega }_1\) replaced by \(\omega _1\) and \(\exp \{-C_3n^{d\theta }\}\) added to the right-hand side. Finally, since \(\mu _1=\inf _nn^{-1}Q[T_n(\omega _1)]\), we can further replace \(Q[T_n(\omega _1)]\) by \(n\mu _1\) and arrive at
Choosing \(\lambda >0\) small, we get the desired bound.
The case \(\alpha <1\) is simpler since we readily get \(\sup _{\omega '}T_n(\bar{\omega }_1^{(m)})-T_n(\bar{\omega }_1) \le 2d^\alpha n^{\alpha \theta }\) uniformly in m just as in (13). \(\square \)
4 Proof of Theorem 1.3
In this section, we continue to assume that \(\eta \) is realized as in (17) in the previous section. Recall also that we defined \(s_p=(\log \frac{1}{p})^{1/d}\), which is asymptotic to \((1-p)^{1/d}\) as \(p\uparrow 1\). The positivity of \(\mu _1\) can proved by essentially the same argument as in the upper bound: see Remark 4.4 below. Let us first complete the proof of (5) assuming it.
Proof
(Lower bound) Let \(\pi _n\) be a minimizing path for \(T_n(\omega _p)\). Then obviously,
and hence
By letting \(p\uparrow 1\) and using Theorem 1.5, we get the desired lower bound. \(\square \)
The upper bound is more laborious since we have to show that the number of paths makes negligible contribution. We closely follow the argument of Mountford in [28].
Proof
(Upper bound) Let \(M=(\alpha +2)/\alpha \) and define a face-to-face passage time
for \(R\in \mathbb {N}\). We fix \(\epsilon >0\) and say that \((k, x)\in \mathbb {N}\times 2\mathbb {Z}^d\) is \(\epsilon \)-good if the following two conditions hold:
-
(i)
\(\varPhi _R(\omega _p-(k,R^Mx)) \ge (\mu _1-\epsilon )R\);
-
(ii)
\(\max _{k+1 \le l \le k+R} \omega _p(\{l\}\times (R^Mx+[-2R^M, 2R^M]^d))\le 4^{d+1}R^{dM}\),
where \(\omega _p-(k,R^Mx)\) is the translation of \(\omega _p\) regarded as a set. Our basic strategy is to show that: (1) if the polymer, scaled by a factor of \(s_p R^{-M}\), comes close to an \(\epsilon \)-good point, then it costs at least \(\exp \{-(\mu _1-\epsilon )R\}\) to survive the next R-duration; (2) most of the times in \(\{jR\}_{j=1}^{[n/R]}\), the polymer is close to an \(\epsilon \)-good point with high probability.
Lemma 4.1
There exists \(p_0(\epsilon )\in (0,1)\) such that
uniformly in \(p\in [p_0(\epsilon ),1]\) and \((k,x)\in \mathbb {N}\times 2\mathbb {Z}^d\).
Proof
By translation invariance, we may assume \((k,x)=(0,0)\) without loss of generality. Note also that the probability of
tends to one as \(R\rightarrow \infty \) by Lemma 3.2. On this event, we know from (18) that
for all p close to one. As a consequence, all the minimizing paths for \(T_R( \omega _p-(0,y))\), that is, the passage time from (0, y) to \(\{R\}\times \mathbb {R}^d\), make jumps of size at most a constant multiple of \(R^{1/\alpha }\). Then by using the mean value theorem, one can check that
for some \(c>0\), since the difference comes only from the starting points.
Thus we can bound
for sufficiently large R, where we have used (23) in the first inequality.
On the other hand, a simple large deviation estimate shows that there is \(c>0\) such that for any \(l\in \mathbb {N}\),
and summing over \(l\in \{1,2,\ldots ,R\}\), we get
as \(R\rightarrow \infty \). \(\square \)
Let us write \(C_p(x)=s_p^{-1}(R^Mx+[-R^M,R^M]^d)\) for shorthand.
Lemma 4.2
For sufficiently large \(R\in \mathbb {N}\), there exists \(p_1(R,\epsilon )>0\) such that if \(p\in [{p_1(R,\epsilon )},1)\) and (k, x) is \(\epsilon \)-good, then
Proof
We again assume that \((k,x)=(0,0)\) without loss of generality. We first prove
so that we may assume the contrary. When \(\alpha \le 1\), one can readily check that
Since our assumption on the transition probability implies
Chebyshev’s inequality yields
For \(\alpha >1\), we use Jensen’s inequality to get
With the help of (25), the rest of the proof is similar to the above.
Thanks to the condition (i), every path satisfying \(H^\eta _R(X)=0\) has probability at most
under \(P(\cdot |X_0=y)\). On the other hand, condition (ii) ensures that there are at most \((4^{d+1}R^{dM})^R\) such paths which, in addition, stay inside \([0,R]\times s_p^{-1}[-2R^M, 2R^M]\). Therefore we have
and since \(s_p\) tends to zero as \(p\uparrow 1\), the assertion follows. \(\square \)
Let \(\psi _{\epsilon }(k,x)=c_2(\mu _1-2\epsilon ) 1_{\{({kR}, x) \text { is}\, \epsilon \text {-good}\}}\) and
For \(\gamma \in \varGamma \) and an integer \(v\ge 1\), we define
Lemma 4.3
Let R and p be as in Lemma 4.1 and 4.2. Then for any \(v\ge 1\) and \(\gamma \in \varGamma \),
Proof
We use Markov property at times \(R,2R, \ldots , {(v-1)R}\) to bound the left-hand side by
where \(\theta _k\) (\(k\in \mathbb {N}\)) is the time-shift operator acting on the space of environments. By Lemma 4.2, it immediately follows that
for sufficiently large R. On the other hand, one can show
for large R in the same way as that for (24). \(\square \)
This lemma gives a control only for a fixed \(\gamma \) but we can indeed reduce the problem to a single \(\gamma \) as follows: We have for any \(\epsilon \in (0,1)\) that
When p is so close to 1 that \(s_p^{-\alpha }\epsilon C_5 R^2 \ge 1\), for some \(c>0\) depending only on d and \(\alpha \),
Thus it follows that
To conclude the proof of the upper bound, it remains to show
almost surely. Without the infimum over \(\gamma \), the above is a consequence of the law of large numbers together with Lemma 4.1. We indeed have the tail bound
by Bernstein’s inequality. The right-hand side is \(o(\exp \{-cv\})\) for any \(c>0\) when R is sufficiently large, due to Lemma 4.1. We show that the infimum has no effect by counting the number of relevant \(\gamma \)’s. Obviously we can restrict our consideration to those \(\gamma \) with
Since we can find \(c\ge 1\) such that \(x^\alpha \le c(x-1)_+^\alpha +c\) for \(x\ge 0\), the above implies
for all sufficiently large \(R>0\). We bound the number of such sequences by
where \(\gamma _j^{(i)}\) stands for i-th coordinate of \(\gamma _j\). Indeed, when \(\alpha \le 1\) this holds with \(c'=2cd\) as a consequence of the concavity of \(x\mapsto x^\alpha \) and, when \(\alpha >1\) with \(c'=2cd^{\alpha }\) by \(\sum _{1\le i \le d}|x_i|^{\alpha }\le (\sum _{1\le i \le d}|x_i|)^{\alpha }\). The right-hand side of (27) is nothing but the volume of
where \(|x|_\alpha =(\sum _{i=1}^{dv}|x_i|^\alpha )^{1/\alpha }\). As any point y in \(x+[0,1]^{dv}\) satisfies
the right-hand side of (27) is bounded by the volume of \(l^\alpha \)-ball in \(\mathbb {R}^{dv}\) with radius \(( 2^{\alpha +2}c'v)^{1/\alpha }\), which is known to be
One can check by using Stirling’s formula that this is only exponentially large in v. Therefore, with the help of (26), we find that
decays exponentially in v when R is sufficiently large. \(\square \)
Remark 4.4
We explain how to modify the above block argument to prove \(\mu _p>0\) for \(p\in (0,1]\). We first replace the condition (i) of the \(\epsilon \)-good box (\(\epsilon \in (0,1)\)) by
and drop (ii). With this modified definition of \(\epsilon \)-good box, it is simple to check that the following variant of Lemma 4.1 holds for general \(p\in (0,1]\):
Next we replace \(J_v(\gamma )\) for \(\gamma \in \varGamma \) by
If \(C_5'\) is sufficiently small, we can easily verify that any minimizing path \(\pi _n\) for \(T_n(\omega _p)\) with \(\pi _n(jR)\in C_p(\gamma _j)\) (\(0\le j\le n/R\)) has passage time larger than \(J'_v(\gamma )\). Therefore we get
and, when \(R\in \mathbb {N}\) is chosen sufficiently large and \(\epsilon \) small, we have
in exactly the same way as above.
References
Amir, G., Corwin, I., Quastel, J.: Probability distribution of the free energy of the continuum directed random polymer in \(1+1\) dimensions. Commun. Pure Appl. Math. 64(4), 466–537 (2011)
Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities. Oxford University Press, Oxford (2013)
Carmona, P., Hu, Y.: On the partition function of a directed polymer in a Gaussian random environment. Probab. Theory Relat. Fields 124(3), 431–457 (2002)
Carmona, R., Koralov, L., Molchanov, S.: Asymptotics for the almost sure Lyapunov exponent for the solution of the parabolic Anderson problem. Random Oper. Stoch. Equ. 9(1), 77–86 (2001)
Carmona, R.A., Molchanov, S.A.: Parabolic Anderson problem and intermittency. Mem. Am. Math. Soc. 108(518), viii+125 (1994)
Comets, F., Cranston, M.: Overlaps and pathwise localization in the Anderson polymer model. Stoch. Process. Appl. 123(6), 2446–2471 (2013)
Comets, F., Popov, S., Vachkovskaia, M.: The number of open paths in an oriented \(\rho \)-percolation model. J. Stat. Phys. 131(2), 357–379 (2008)
Comets, F., Shiga, T., Yoshida, N.: Directed polymers in a random environment: path localization and strong disorder. Bernoulli 9(4), 705–723 (2003)
Comets, F., Yoshida, N.: Brownian directed polymers in random environment. Commun. Math. Phys. 254(2), 257–287 (2005)
Comets, F., Yoshida, N.: Directed polymers in random environment are diffusive at weak disorder. Ann. Probab. 34(5), 1746–1770 (2006)
Comets, F., Yoshida, N.: Localization transition for polymers in Poissonian medium. Commun. Math. Phys. 323(1), 417–447 (2013)
Cox, J.T.: The time constant of first-passage percolation on the square lattice. Adv. Appl. Probab. 12(4), 864–879 (1980)
Cox, J.T., Kesten, H.: On the continuity of the time constant of first-passage percolation. J. Appl. Probab. 18(4), 809–819 (1981)
Cranston, M., Mountford, T.S.: Lyapunov exponent for the parabolic Anderson model in \({ R}^d\). J. Funct. Anal. 236(1), 78–119 (2006)
Cranston, M., Mountford, T.S., Shiga, T.: Lyapunov exponents for the parabolic Anderson model. Acta Math. Univ. Comenian. (N.S.) 71(2), 163–188 (2002)
Cranston, M., Mountford, T.S., Shiga, T.: Lyapunov exponent for the parabolic Anderson model with Lévy noise. Probab. Theory Relat. Fields 132(3), 321–355 (2005)
Darling, R.W.R.: The Lyapunov exponent for products of infinite-dimensional random matrices. In: Lyapunov exponents (Oberwolfach, 1990). Lecture Notes in Mathematics, vol. 1486, pp. 206–215. Springer, Berlin (1991)
Fukushima, R., Yoshida, N.: On exponential growth for a certain class of linear systems. ALEA Lat Am. J. Probab. Math. Stat. 9(2), 323–336 (2012)
Garet, O., Gouéré, J.B., Marchand, R.: The number of open paths in oriented percolation (2015, preprint). arXiv:1312.2571
Griffeath, D.: The binary contact path process. Ann. Probab. 11(3), 692–705 (1983)
Howard, C.D., Newman, C.M.: Euclidean models of first-passage percolation. Probab. Theory Relat. Fields 108(2), 153–170 (1997)
Howard, C.D., Newman, C.M.: Geodesics and spanning trees for Euclidean first-passage percolation. Ann. Probab. 29(2), 577–623 (2001)
Kasahara, Y.: Tauberian theorems of exponential type. J. Math. Kyoto Univ. 18(2), 209–219 (1978)
Kesten, H.: Aspects of first passage percolation. In: École d’été de probabilités de Saint-Flour, XIV—1984. Lecture Notes in Mathematics, vol. 1180, pp. 125–264. Springer, Berlin (1986)
Kesten, H., Sidoravicius, V.: A problem in last-passage percolation. Braz. J. Probab. Stat. 24(2), 300–320 (2010)
Lacoin, H.: Existence of an intermediate phase for oriented percolation. Electron. J. Probab. 17(41), 17 (2012)
Moriarty, J., O’Connell, N.: On the free energy of a directed polymer in a Brownian environment. Markov Process Relat Fields 13(2), 251–266 (2007)
Mountford, T.S.: A note on limiting behaviour of disastrous environment exponents. Electron. J. Probab. 6(1), 9 (2001). (electronic)
Nagaev, S.V.: Large deviations of sums of independent random variables. Ann. Probab. 7(5), 745–789 (1979)
Seppäläinen, T.: Scaling for a one-dimensional directed polymer with boundary conditions. Ann. Probab. 40(1), 19–73 (2012)
Shiga, T.: Exponential decay rate of survival probability in a disastrous random environment. Probab. Theory Relat. Fields 108(3), 417–439 (1997)
Yoshida, N.: Phase transitions for the growth rate of linear stochastic evolutions. J. Stat. Phys. 133(6), 1033–1058 (2008)
Acknowledgments
The first author was partially supported by CNRS, UMR 7599. The second author was supported by JSPS KAKENHI Grant Number 24740055. The fourth author was supported by JSPS KAKENHI Grant Number 25400136.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
We provide a proof of (3) for completeness. We consider \(d=1\) case first since the other case will reduce to it. Set
For \(R>0\) and \((m,x)\in {\mathscr {L}}\), we say (m, x) is open if there exists a \(y_m\in Rx+(-R,R)\cap \mathbb {Z}\) such that \(\eta (m,y_m)=0\). It is easy to see that
as \(R\rightarrow \infty \). Thus when R is large, the directed site percolation on \({\mathscr {L}}\) is supercritical and we can find a percolation point \((1,x)\in {\mathscr {L}}\). This implies that there exists a path \(\{(k,y_k)\}_{k\ge 1}\) satisfying
for all \(k\ge 1\). Then it follows that
For the case \(d\ge 2\), we have
and the right-hand side can be bounded from below in the same way as for \(d=1\).
Rights and permissions
About this article
Cite this article
Comets, F., Fukushima, R., Nakajima, S. et al. Limiting Results for the Free Energy of Directed Polymers in Random Environment with Unbounded Jumps. J Stat Phys 161, 577–597 (2015). https://doi.org/10.1007/s10955-015-1347-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-015-1347-1