Disorder relevance for the random walk pinning model in dimension 3
Matthias Birkner, Rongfeng Sun

TL;DR
This paper demonstrates disorder relevance in the 3-dimensional continuous-time random walk pinning model, showing a phase transition influenced by disorder, using advanced probabilistic techniques and extending local limit theorems.
Contribution
It proves disorder relevance at the critical dimension d=3 for symmetric, irreducible jump kernels, filling a gap in the understanding of the model's phase transition behavior.
Findings
Disorder relevance established in dimension 3.
Critical point shift is at least exponential in parameters.
Extended local limit theorem for renewal processes with infinite mean.
Abstract
We study the continuous time version of the random walk pinning model, where conditioned on a continuous time random walk Y on Z^d with jump rate \rho>0, which plays the role of disorder, the law up to time t of a second independent random walk X with jump rate 1 is Gibbs transformed with weight e^{\beta L_t(X,Y)}, where L_t(X,Y) is the collision local time between X and Y up to time t. As the inverse temperature \beta varies, the model undergoes a localization-delocalization transition at some critical \beta_c>=0. A natural question is whether or not there is disorder relevance, namely whether or not \beta_c differs from the critical point \beta_c^{ann} for the annealed model. In Birkner and Sun [BS09], it was shown that there is disorder irrelevance in dimensions d=1 and 2, and disorder relevance in d>=4. For d>=5, disorder relevance was first proved by Birkner, Greven and den…
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 · Markov Chains and Monte Carlo Methods · Theoretical and Computational Physics
\marginsize
2.3cm2.3cm1cm2cm
Disorder relevance for the random walk pinning model in dimension
Matthias Birkner* 1*, Rongfeng Sun* 2*
(Apr 20, 2010)
Abstract
We study the continuous time version of the random walk pinning model, where conditioned on a continuous time random walk on with jump rate , which plays the role of disorder, the law up to time of a second independent random walk with jump rate is Gibbs transformed with weight , where is the collision local time between and up to time . As the inverse temperature varies, the model undergoes a localization-delocalization transition at some critical . A natural question is whether or not there is disorder relevance, namely whether or not differs from the critical point for the annealed model. In [BS09], it was shown that there is disorder irrelevance in dimensions and , and disorder relevance in . For , disorder relevance was first proved in [BGdH08]. In this paper, we prove that if and have the same jump probability kernel, which is irreducible and symmetric with finite second moments, then there is also disorder relevance in the critical dimension , and is at least of the order , , for any . Our proof employs coarse graining and fractional moment techniques, which have recently been applied by Lacoin [L09] to the directed polymer model in random environment, and by Giacomin, Lacoin and Toninelli [GLT09] to establish disorder relevance for the random pinning model in the critical dimension. Along the way, we also prove a continuous time version of Doney’s local limit theorem [D97] for renewal processes with infinite mean.
AMS 2000 subject classification: 60K35, 82B44.
Keywords: collision local time, disordered pinning models, fractional moment method, local limit theorem, marginal disorder, random walks, renewal processes with infinite mean.
11footnotetext: Institut für Mathematik, Johannes-Gutenberg-Universität Mainz, Staudingerweg 9, 55099 Mainz, Germany. Email: [email protected]: Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, 119076 Singapore. Email: [email protected]
1 Model and result
Let us recall the continuous time random walk pinned to random walk model studied in [BS09], which we will abbreviate from now on as the random walk pinning model (RWPM). Let and be two continuous time random walks on starting from the origin, such that and have respectively jump rates and , and identical irreducible symmetric jump probability kernels on with finite second moments. Let denote the law of . Then given and conditioned on , which we interpret as a random environment or disorder, we define a Gibbs transform of the path measure via Radon-Nikodym derivative
[TABLE]
where , and
[TABLE]
is the quenched partition function with denoting expectation w.r.t. starting from . We can interpret as a polymer which is attracted to a random defect line . A more commonly studied model is to consider a constant defect line , but with random strength of interaction between and at different time points. This is known as the random pinning model (RPM), the discrete time analogue of which was the subject of many recent papers (see e.g. [DGLT09, GLT08, GLT09]), as well as a book [G07].
A common variant of the Gibbs measure is to introduce pinning of path at the end point , i.e., we define the Gibbs measure with
[TABLE]
with Z^{\beta,\rm pin}_{t,Y}={\mathbb{E}}^{X}_{0}\big{[}e^{\beta L_{t}(X,Y)}1_{\{X_{t}=Y_{t}\}}\big{]}. It was shown in [BS09] that, almost surely w.r.t. , the limit
[TABLE]
exists and is independent of the disorder , which we call the quenched free energy of the model. There exists a critical inverse temperature , such that if and if . The supercritical region is the localized phase where given , and with respect to either or , the contact fraction between and up to time typically remains positive as , so that the walk is pinned to . In fact, by the convexity of in and (1.4), it is not hard to see that almost surely,
[TABLE]
where and denote respectively the left and right derivative w.r.t. . The convexity of in implies that for all . In contrast, the subcritical region is the de-localized phase, where and the contact fraction is typically of order as , so that becomes delocalized from .
An important tool in the study of models with disorder is to compare the quenched free energy with the annealed free energy, which is defined by
[TABLE]
where
[TABLE]
are the free (resp. constrained) versions of the annealed partition function for the RWPM. Since is also a random walk, we see that and are the partition functions of a RWPM where the random walk is attracted to the constant defect line [math]. This defines the annealed model. In particular, there also exists a critical point such that when and when . It is easy to show that , where is the Green function of , see end of Sec. 2, while no explicit expression for is known. By Jensen’s inequality, it is easily seen that , and hence . A fundamental question is then to determine whether the disorder is sufficient to shift the critical point of the model so that , which is called disorder relevance. If , then we say there is disorder irrelevance, and it is generally believed that the quenched model’s behavior in this case is similar to that of the annealed model. It turns out that disorder relevance/irrelevance has an interesting dependence on the spatial dimension .
In [BS09], it was shown that if and are continuous time simple random walks, then the RWPM is disorder irrelevant in and , and disorder relevant in . Furthermore, it was shown that in , there exists such that for all ; while in , for any , there exists such that for all . It is easy to check that the proof of these results in [BS09] apply equally well to continuous time random walks and with the same irreducible symmetric jump probability kernel with finite second moments. In this paper, we resolve the marginal case and show that there is disorder relevance.
Theorem 1.1
**[Annealed vs quenched critical points]
**Let and be two continuous time random walks with respective jump rates and and identical irreducible symmetric jump probability kernel on with finite second moments. Assume . Then for the associated RWPM, for all , and for any , there exists such that for all ,
[TABLE]
Remark. It is intriguing that our lower bound for the critical point shift is of the same form as for the RPM in the marginal case, where a lower bound of was obtained in [GLT09] for any , and is known to provide an upper bound. For the RWPM, there has been no heuristics or results so far on the upper bound.
Let
[TABLE]
Note that . We will in fact prove the following stronger version of Theorem 1.1.
Theorem 1.2
**[Non-coincidence of critical points strengthened]
**Assuming the same conditions as in Theorem 1.1, then the conclusions therein also hold with replaced by .
Remark. The question whether or remains open, and so is the analogous question for the RPM. Note that when is uniformly bounded in , the distribution of under the measure remains tight as , while if and only if under tends to in probability. If , then there exists a phase in the delocalized regime where under tends to at a rate that is , which would be very surprising.
Theorem 1.2 confirms a conjecture of Greven and den Hollander [GdH07, Conj. 1.8] that in , the Parabolic Anderson Model (PAM) with Brownian noise could admit an equilibrium measure with an infinite second moment. We refer to [BS09, Sec. 1.4] for a more detailed discussion on the connection between the RWPM and the PAM, as well as the connection of the discrete time RPMs and RWPMs with the directed polymer model in random environment.
Our proof of Theorem 1.2 will follow the general approach developed by Giacomin, Lacoin, and Toninelli in [GLT08, GLT09] for proving the marginal relevance of disorder for the random pinning model (RPM), as well as by Lacoin in [L09] for the study of the directed polymer model in random environment. The basic ingredients are change of measure arguments for bounding fractional moments of the partition function , coupled with a coarse grain splitting of . These techniques have proven to be remarkably powerful, and they apply to a wide range of models: in particular, to weighted renewal processes in random environments, including the random pinning, the random walk pinning, and the copolymer models (see [BS09, Sec. 1.4] for a more detailed discussion), as well as to weighted random walks in random environments, including the directed polymer model [L09] and random walk in random environments [YZ09]. We will recall in detail the fractional moment techniques and the coarse graining procedure and formulate them for the RWPM, which will constitute the model independent part of our analysis. A key element of the fractional moment technique involves a change of measure, and more generally, the choice of a suitable test function. This is the model dependent part of the analysis, which in general is far from trivial since disorder relevance in the critical dimension is a rather subtle effect. The bulk of this paper is thus dedicated to the choice of a suitable test function for the RWPM and its analysis. Compared to the RPM and the directed polymer model, new complications arise due to the different nature of the disorder of the RWPM.
We also include here a result on the monotonicity of , resp. , in , which was pointed out to us by the referee along with an elegant proof.
Theorem 1.3
[Monotonicity of critical point shift]*
Assuming the same conditions as in Theorem 1.1 for a RWPM in with , we have*
[TABLE]
In particular,
[TABLE]
We defer its proof to Appendix C. We remark that proving the strict inequalities in (1.9) requires Theorem 1.2 and its analogue in dimensions .
Outline. The rest of the paper is organized as follows. In Section 2, we recall from [BGdH08] and [BS09] a representation of as the partition function of a weighted renewal process in random environment. In Section 3, we recall the coarse graining procedure and fractional moment techniques developed in [GLT08], [L09] and [GLT09]. To prove Theorem 1.2, we apply the coarse graining procedure to instead of the constrained partition function as done in [GLT08, GLT09]. The proof of disorder relevance is then reduced in Section 3 to two key propositions: Prop. 3.1, which is model dependent and needs to be proved for any new weighted renewal process in random environment one is interested in, and Prop. 3.2, which is model independent. Compared to analogues of Prop. 3.1 formulated previously for the RPM (see [GLT09, Lemma 3.1]), our weaker formulation here (more precisely its reduction to Prop. 5.1 in Sec. 5) allows a more direct comparison with renewal processes without boundary constraints, which conceptually simplifies subsequent analysis. In Section 4, we identify a crucial test function for the disorder and state some essential properties. Assuming these properties, we then prove in Section 5 the key Prop. 3.1, which is further reduced to a model dependent Prop. 5.1 by extracting some model independent renewal calculations. In Section 6, we deduce Prop. 3.2 from Prop. 3.1, which is again model independent. The properties of the test function are then established in Sections 7–8. In Appendices A and B, we prove some renewal and random walk estimates which we need for our proof. In particular, we prove in Lemma A.1 a continuous time version of Doney’s local limit theorem [D97, Thm. 3] for renewal processes with infinite mean. Finally, in Appendix C, we include a proof of Theorem 1.3 shown to us by the referee.
Note. During the preparation of this manuscript, we became aware of a preprint by Q. Berger and F.L. Toninelli [BT09], in which they proved disorder relevance for the discrete time RWPM in dimension under the assumption that the random walk increment is symmetric with sub-Gaussian tails. An inspection shows that the main difference between our two approaches lies in the choice of the test function in (4.2), which results in completely different model dependent analysis as well as different assumptions on the model. In principle, both approaches should be applicable to both discrete and continuous time models. Most results in this paper carry over directly to the discrete time case. The only exception is Lemma B.5, for which we do not have a proof for its discrete time analogue. Lemma B.5 is used to prove Lemma 4.2 (4.8)–(4.9). In light of [BT09], we will not pursue this further in this paper.
Notation: Throughout the rest of this paper, unless stated otherwise, we will use , and to denote generic constants whose precise values may change from line to line. However, their values all depend only on the jump rate and the jump probability kernel , and are uniform in .
2 Representation as a weighted renewal process in random environment
First we recall from [BGdH08] and [BS09] a representation of as the partition function of a weighted renewal process in random environment. Let denote the transition probability kernel of at time . Then and have respective transition kernels and . Let
[TABLE]
where is to be interpreted as the renewal time distribution of a recurrent renewal process . Let and . Then
[TABLE]
where
[TABLE]
We can thus interpret as the partition function of a weighted renewal process in the random environment , where the renewal time distribution is given by , and the -th renewal return incurs a weight factor of .
Similarly, for any , we can define when , and otherwise
[TABLE]
where the term for is defined to be . Note that , which we will simply denote by .
Since is the renewal time distribution of a recurrent renewal process on , and note that for any , the critical point of the annealed model with partition function is exactly . By the mapping , we deduce that . The mapping to a weighted renewal process in random environment casts the RWPM in the same framework as the RPM, which paves the way for the application of general approaches developed in [GLT08, GLT09].
3 Fractional moment techniques and coarse graining
We now recall the fractional moment techniques and the coarse graining procedure, which were developed in a series of papers for the RPM that culminated in [GLT08, GLT09], where marginal relevance of disorder was established, as well as in [L09] where the same techniques were applied to the directed polymer model in random environment.
By (1.2), is monotonically increasing in for every realization of . Therefore, to prove Theorem 1.2, it suffices to show that for some , and some depending suitably on , we have
[TABLE]
We will choose below a coarse graining scale and show that for each , (3.1) holds for all if is sufficiently large, which implies and . For , we will let for any fixed , and prove that (3.1) holds for all uniformly in if is large enough. This would then imply the lower bound on in Theorem 1.2.
Note that by using more refined large deviation estimates for the renewal process with waiting time density , it seems possible to extend (3.1) to with a suitable . By the relation between and in our coarse-graining scheme, this would only affect the (unspecified) constant in (1.6), not the exponent itself.
To bound the fractional moment , we apply the inequality
[TABLE]
This seemingly trivial inequality turns out to be exceptionally powerful in bounding fractional moments. However, the success of such a bound depends crucially on how is split into a sum of terms. This is where coarse graining comes in, which was used in [GLT08, L09, GLT09]. We remark that in the earlier paper [DGLT09] on the RPM, and later in the analysis [BS09] of the RWPM in , is partitioned according to the values of the pair of consecutive renewal times which straddle a fixed time . The coarse graining procedure we recall below uses a more refined partition of .
Fix a large constant , which will be the coarse graining scale. Assume that for some . Then we partition into blocks with . The coarse graining procedure simply groups terms in (2.1) according to which blocks does the renewal configuration intersect. More precisely, the set of blocks in which intersects can be represented by a set . Then we can decompose in (2.1) as
[TABLE]
where , and for each ,
[TABLE]
where . By (3.2), for any , we have
[TABLE]
We will prove (3.1) by comparing {\mathbb{E}}^{Y}_{0}\big{[}({\cal Z}^{z,I}_{t,Y})^{\gamma}\big{]} with the probability that a subcritical renewal process on intersects exactly at .
To bound {\mathbb{E}}^{Y}_{0}\big{[}({\cal Z}^{z,I}_{t,Y})^{\gamma}\big{]}, one introduces a change of measure. Let be a non-negative function of the disorder . By Hölder’s inequality,
[TABLE]
To decouple different blocks , we will let with
[TABLE]
To make {\mathbb{E}}^{Y}_{0}\big{[}\big{(}{\cal Z}^{z,I}_{t,Y}\big{)}^{\gamma}\big{]} small, should be chosen to make {\mathbb{E}}^{Y}_{0}\big{[}f_{I}(Y){\cal Z}^{z,I}_{t,Y}\big{]} small. There have been two approaches in bounding {\mathbb{E}}^{Y}_{0}\big{[}f_{I}(Y){\cal Z}^{z,I}_{t,Y}\big{]} in the literature.
The first approach is to choose to be a probability density so that {\mathbb{E}}^{Y}_{0}\big{[}f_{I}(Y){\cal Z}^{z,I}_{t,Y}\big{]} becomes the annealed partition function of a RWPM with a new law for the disorder . This approach was used in [DGLT09] to prove disorder relevance for the RPM, where the laws of the disorder at different time points are independently tilted to favor delocalization. It was later adapted to the RWPM in dimensions in [BS09], where the change of measure for increases its jump rate, which turns out to favor delocalization. To prove disorder relevance for the RPM at the critical dimension, the so-called marginal disorder relevance, which borderlines the known disorder relevance/irrelevance regimes, a more sophisticated change of measure was introduced in [GLT08] for the RPM with Gaussian disorder, which induces negative correlation between the disorder at different time points, and Gaussian calculations are used to estimate the annealed partition function under the new disorder. For the RWPM in the critical dimension , the analogue would be to introduce correlation between the increments of at different time steps. However the presence of correlation makes it unfeasible to estimate the annealed partition function under the new disorder.
A variant approach to estimate {\mathbb{E}}^{Y}_{0}\big{[}f_{I}(Y){\cal Z}^{z,I}_{t,Y}\big{]} was then introduced in [L09] for the directed polymer model in random environment, and later in [GLT09] for the RPM at the critical dimension with general disorder. The function will be taken to be a test function on the disorder instead of as a probability density that changes the law of . For simplicity, in (3.6) is taken to be of the form
[TABLE]
where is a functional of the disorder , positively correlated with , and we choose
[TABLE]
to guarantee that (3.6) holds. We will make small by choosing large. To bound {\mathbb{E}}^{Y}_{0}\big{[}f_{I}(Y){\cal Z}^{z,I}_{t,Y}\big{]}, we use the representation (3.3) to write
[TABLE]
where . By Lemma B.1, the local central limit theorem for and , there exists such that uniformly in and , we have
[TABLE]
Therefore
[TABLE]
where we used the independence of , . The proof of (3.1), and hence Theorem 1.2, then hinges on the following key proposition.
Proposition 3.1
Let , and let for any fixed . Then for every and , we can find suitable choices of and in (3.7), such that for sufficiently large, which can be chosen uniformly for , and for all , and , we have
[TABLE]
where
[TABLE]
with term for defined to be , is the renewal density associated with .
We will show that Prop. 3.1 implies the following:
Proposition 3.2
Let and be as in Prop. 3.1. Then for every , we can choose sufficiently large, which can be chosen uniformly for , such that for all , , and , we have
[TABLE]
for some depending only on .
By (3.4) and (3.5), Prop. 3.2 implies that uniformly in , , we have
[TABLE]
which is finite if we choose , and sufficiently small such that . By the monotonicity of in , this implies (3.1), and hence Theorem 1.2 by the discussion following (3.1).
The key is therefore Prop. 3.1, which is the model dependent part and whose proof will be the focus of the rest of this paper. The new idea developed in [L09] and [GLT09] to bound quantities like is to use the renewal representation (2.3) to write
[TABLE]
where has been interpreted as the density for a change of measure for , and denotes expectation with respect to a random path whose law is absolutely continuous with respect to that of with density . Recall the form of in (3.7): the key point is to choose the functional such that for typical realizations of and , is much larger than typical values of H_{L}\big{(}(Y_{s})_{s\in[0,L]}\big{)}. Then in (3.7), we can choose large such that and . The factor in (3.15) can be bounded by a constant of order if , since conditioned on the renewal process with , the number of renewal returns in is typically of the order .
Remark. The above procedure applies to general weighted renewal processes in random environments, whose partition functions can be represented in the form of (2.3) and (2.1), where given a random environment with stationary independent increments and a renewal configuration , each two consecutive renewal times give rise to a weight factor . See e.g. [BS09, Section 1.3] for a more detailed exposition on how random pinning, random walk pinning, and copolymer models can all be seen as renewal processes in random environments with different weight factors . With proper normalization, can always be interpreted as a change of measure for the disorder .
4 Mean and variance of and
We will now choose the functional in (3.7), state its essential properties, and briefly outline how these properties may lead to Prop. 3.1. Given a renewal configuration , the new disorder random walk introduced in (3.15) has heuristically smaller fluctuations than due to the density which favors values of that are close to . A natural choice for in (3.7) is then the following. Fix , where later in the proof of Prop. 3.1 we will set . The reason for this choice of will be explained briefly at the end of this section. Given as in Theorem 1.1, let
[TABLE]
Then we define
[TABLE]
We have the following bound on the mean and variance of .
Lemma 4.1
Let be defined as in (4.2). Then
[TABLE]
and there exists some such that uniformly for all and ,
[TABLE]
Remark. The condition guarantees the validity of (4.4). The technical reason for the relation , hence , will become evident in the proof Lemma 5.1, see especially (5.15), below.
To show that in (3.15), is small for typical realizations of , it then suffices to show that for typical realizations of and , , where can be made arbitrarily large by choosing large in , with uniform for . Thus we need to bound the mean and variance of conditioned on . Recall that given , the law of is absolutely continuous with respect to the law of with density . Due to the dependency structure of , we will decompose in (4.2) according to whether or not the variables of integration satisfy in order to extract some independence. Namely,
[TABLE]
where for any ,
[TABLE]
and
[TABLE]
arises because may include pair correlation terms with , which is excluded in the definition of . Note that
[TABLE]
Conditional on , for any two consecutive renewal times , we then have the following bounds on the mean of and , and the variance of .
Lemma 4.2
For any and , we have
[TABLE]
Furthermore,
[TABLE]
and
[TABLE]
where denotes variance w.r.t. conditioned on , and the s in (4.10)–(4.11) are uniform in and .
Let us sketch briefly how Lemma 4.2 can be used to deduce Prop. 3.1. Let be a renewal process conditioned on , and let be defined accordingly by changing the measure of independently on each renewal interval . By the discussion following (3.15), the key to proving Prop. 3.1 is to show that for typical and , is much larger than typical values of . Using the decomposition (4.5), this is achieved by controlling the mean and variance of and conditional on , which is facilitated by Lemma 4.2. If we only want to establish disorder relevance for a fixed , which amounts to proving Prop. 3.1 (more precisely, its reduction, Prop. 5.1) by choosing sufficiently large for a fixed , we can avoid quantitative estimates by simply applying the law of large numbers to the i.i.d. sequence \big{(}{\mathbb{E}}^{Y^{\sigma}}_{0}[H_{[\sigma_{i-1},\sigma_{i}]}^{\rm int}(Y^{\sigma})]\big{)}_{i\in{\mathbb{N}}} and the ergodic theorem to the ergodic sequence \big{(}H_{[\sigma_{i-1},\sigma_{i}]}^{\rm ext}(Y^{\sigma})\big{)}_{i\in{\mathbb{N}}} to show that, if is sufficiently large, then for typical , the conditional mean of
[TABLE]
far exceeds its conditional standard deviation as well as the standard deviation of , which are of the order by (4.4) and (4.11); while for typical and ,
[TABLE]
To get quantitative bounds on the gap between the annealed and the quenched critical points, we need to get bounds on , and this is achieved by replacing the law of large numbers above with a quantitative estimate on , and replacing the ergodic theorem with a quantitative bound on the conditional variance of and then applying the Markov inequality. The details will be given in Sec. 5.
The reason for choosing in the definition of is the following. When we lower bound the conditional mean in (4.12) (conditional on ) using (4.10), we need to choose as large as possible. It turns out that any power of will suffice, as will be seen in the proof of Lemma 5.3. On the other hand, when we upper bound the conditional variance of , we need to choose to be a sufficiently small power of , which can be seen from the bounds in (4.7) as well as in the proof of Lemma 5.2. The choice turns out to be sufficient for our purposes.
5 Proof of Proposition 3.1
We now prove Prop. 3.1 using the functional defined in (4.2) and Lemmas 4.1 and 4.2. We remark that Prop. 3.1 is the analogue of [GLT09, Lemma 3.1] formulated for the discrete time random pinning model. The main difference is that [GLT09, Lemma 3.1] involves a comparison of the integrands on both sides of (3.12) for each with . Our integral formulation of (3.12) allows us to reduce more easily estimates involving renewal configurations pinned at two points to renewal configurations pinned only at . More precisely, we reduce Prop. 3.1 to the following proposition by extracting some model independent renewal calculations.
Proposition 5.1
Let and in the definition of in (4.2), with as in Prop. 3.1. Then for every and , we can find and set in (3.7), such that for all sufficiently large, which can be chosen uniformly for , and for all and , we have
[TABLE]
where .
Proof of Prop. 3.1. The deduction of Prop. 3.1 from Prop. 5.1 is model independent and depends only on . Since , we have . By Lemma A.1, we also have , where is defined in (3.13). Therefore, given and for (and hence ) large, there exist and depending only on , such that uniformly for all and , we have
[TABLE]
Under the assumptions of Prop. 3.1, by Prop. 5.1, we have
[TABLE]
where depends only on and and is uniform for . Together with (5.2), this implies
[TABLE]
where we used the assumption that . Since given , we can choose arbitrarily small by Prop. 5.1, (3.12) then follows. The proof of (3.11) is similar. Note that we need (3.11) because we are studying , instead of the constrained partition function as in [GLT09].
The proof of Prop. 5.1 is based on two lemmas, for which we first introduce some notation. Let be a renewal process on with renewal time distribution , and let . Let and denote respectively probability and expectation for . Let be defined analogously to , where conditional on , for each , the law of is absolutely continuous w.r.t. the law of with Radon-Nikodym derivative
[TABLE]
Then we have
Lemma 5.1
Let , and . Let for some . For any and , if is sufficiently large, which can be chosen uniformly for , then for all , we have
[TABLE]
Lemma 5.2
Let , , , and be as in Lemma 5.1. For any , if is sufficiently large, which can be chosen uniformly for , then for all , we have
[TABLE]
We defer the proofs of Lemmas 5.1–5.2 and first deduce Prop. 5.1.
Proof of Prop. 5.1. Let , and be as introduced before Lemma 5.1. Then we define for , and for . By (3.15), uniformly in , we may rewrite the LHS of (5.1) as
[TABLE]
where the bound for follows from standard large deviation estimates for the i.i.d. random variables . In (5.5), the first and the last terms can both be made arbitrarily small by choosing large enough, and large enough in , which follows from (3.8) and (4.4).
Recall the decomposition of in (4.5). Fix any . Since on , by Lemma 5.1, we can choose large enough (uniformly for ) such that for all , we have
[TABLE]
By the same reasoning as in (4.7), we note that and differ by at most . Therefore by Lemma 5.2, we can choose large enough such that
[TABLE]
In the decomposition of in (4.5), again by (4.7), we have
[TABLE]
where is defined exactly as with replaced by . The same calculation as in the proof of Lemma 4.1 (4.4), to appear in Section 7, shows that and . Since by construction, have the same increments as on and , we can choose large enough such that
[TABLE]
If we first choose large and then large, and let , then by the decomposition of in (4.5) and (5.6)–(5.9), we find that in (5.5), we have
[TABLE]
Since can be made arbitrarily small, Prop. 5.1 then follows.
We now prove Lemmas 5.1–5.2 by controlling the mean and variance of and , conditional on . Our bound on the conditional mean of is based on the following lemma, which also leads to our choice of .
Lemma 5.3
Let be i.i.d. with common distribution on , where we have . Let with , where and . Then there exists such that for any and , if is sufficiently large, which can be chosen uniformly for , then we have
[TABLE]
Proof. If is sufficiently large, which can be chosen uniformly for , we have
[TABLE]
for some independent of , and . We then prove (5.10) by a large deviation estimate. Namely, if we let , then for any , we have
[TABLE]
Let . Then for sufficiently large, uniformly in , we have
[TABLE]
Therefore the RHS of (5.11) is bounded by , which tends to [math] uniformly in as , thus implying (5.10).
Proof of Lemma 5.1. For , let , which are i.i.d. with common distribution . By Lemma A.2, for any , we can find small enough such that for all sufficiently large and uniformly in , we have
[TABLE]
By Lemma 4.2 (4.10), almost surely with respect to ,
[TABLE]
while by Lemma 5.3, given and , we can find such that for all sufficiently large, we have
[TABLE]
Therefore for a set of with probability at least , conditional on , we have
[TABLE]
where and we used . For any , by Lemma 4.2 (4.11),
[TABLE]
can be made arbitrarily large by choosing large. Therefore for any and for all satisfying (5.15), by making sufficiently large, we have by Markov inequality
[TABLE]
Since the set of that violates (5.15) has probability at most , this implies (5.3).
Proof of Lemma 5.2. By Lemma 4.2 (4.8), for all , we have
[TABLE]
Therefore to establish (5.4), by Markov inequality, it suffices to show that: For any , if in is sufficiently large (uniform for ), then for all , we have
[TABLE]
We will decompose the sum to extract some independence.
Given , let , and for , define inductively
[TABLE]
Let . Then we have the decomposition
[TABLE]
Now note that conditional on , , , and are all independent. Similarly, for even (resp. odd) , are all independent. Therefore using independence and the fact that (with , , ), we have
[TABLE]
By (4.7), for each . Similarly, using the definition of in (4.6),
[TABLE]
Therefore we obtain from (5.17)
[TABLE]
Note that , in particular, the second term on the right-hand side of (5.17) is accounted for in (5.18).
Let , which are i.i.d. Then is a stopping time w.r.t. the sequence , and by Wald’s equation [D96, Sec. 3.1],
[TABLE]
where we used Lemma A.2 and the discussion following it to deduce , and we bounded by . Note that , , is an i.i.d. sequence of -valued random variables, and is a stopping time with respect to this sequence. So again by Wald’s equation,
[TABLE]
where if we denote and , then
[TABLE]
where we have used Wald’s second equation [D96, Sec. 3.1] and the fact that is a stopping time for , which is geometrically distributed with and for . Collecting the above estimates and substituting them in (5.18) then yields
[TABLE]
which by Markov inequality implies (5.16) if , and hence , is sufficiently large.
6 Proof of Proposition 3.2
The deduction of Prop. 3.2 from Prop. 3.1 is model independent. Part of the proof is similar to its discrete time analogue (see e.g. the proofs of Proposition 2.3 and Lemma 2.4 in [GLT09]), with the main difference being that in the integrals in (3.11)–(3.12), we have excluded not only contributions from , but also from . The latter requires new bounds.
First note that by (2.3), for any and , we have
[TABLE]
where is defined in (3.13), and is uniform in and ’s jump rate . For the inequality in the third line, we used and , while the equality in the last line follows by Taylor expanding as in (2.1) and setting , i.e. , in (2.3) and then averaging over . Let for some . Then by (3.10), Prop. 3.1, and (6.1),
[TABLE]
We will show that for any , if and are chosen sufficiently small, then we have
[TABLE]
Prop. 3.2 then follows from the bound
[TABLE]
where depends only on .
First we give a proof of (6.4), which is similar to its discrete time counterpart, [GLT09, Lemma 2.4]. We partition into blocks of consecutive integers , , …, , where for all . When substituting the definition of in (3.13) into (6.4), the resulting multifold expansion is the probability of a set of renewal configurations, where the variables of integration constitute the renewal configuration . By only retaining the constraint that intersects and for , we obtain
[TABLE]
where . We integrate out one pair of variables at a time. For ,
[TABLE]
since , and hence . Regardless of whether or , by Lemma A.1, we have
[TABLE]
Integrating out in (6.5) thus gives a factor . Iterating this procedure then gives the bound in (6.4), where a prefactor arises when we integrate out and in the case . This proves (6.4).
To deduce (6.3) from (6), we first bound the contributions from . We claim that there exists some depending only on and uniform in , such that for all sufficiently large, , and , we have
[TABLE]
To prove (6.7), note that either or in the integral. Using the fact that by the local central limit theorem and the fact that by Lemma A.1, we have
[TABLE]
where we used and . On the other hand,
[TABLE]
Together with a similar bound for the LHS of (6.7) integrated over , this implies (6.7). The proof of (6.8) is similar and will be omitted. Substituting (6.7) and (6.8) into (6) then gives
[TABLE]
where , which can be made arbitrarily small by choosing and small. By expanding the product , we note that (6.3) follows once we show that there exists some such that for any , we have
[TABLE]
where was defined in (6.4).
If , then (6.10) is trivial; otherwise, let be the largest element in . It suffices to show that we can replace the indicator by the factor . We can then apply the argument inductively to deduce (6.10). There are three cases: either (1) ; or (2) ; or (3) . For the case , it suffices to show that uniformly in , we have
[TABLE]
Note that by Lemma A.1, uniformly in , we have for large. Uniformly in , we also have . It follows that
[TABLE]
On the other hand, by Lemma A.1, . Therefore for sufficiently large,
[TABLE]
The above two estimates together imply (6.11).
For case (2), , it suffices to show that uniformly in and , we have
[TABLE]
This follows from the same proof as for (6.11) once we note that, because , uniformly in and , we have for some depending only on .
For case (3), , there are two subcases: either or . We only examine the case , since the case is similar and simpler. To simplify notation, we will shift coordinates and assume and . Since is the largest element in , it suffices to show that uniformly in and , we have
[TABLE]
By restricting the region of integration to , , and , and using the fact that , , , we find
[TABLE]
To upper bound the LHS of (6.12), we claim that uniformly in all , we have
[TABLE]
and uniformly for all and , we have
[TABLE]
which when substituted into the LHS of (6.12) imply that
[TABLE]
where we used the fact that . Together with (6.13), this implies (6.12).
To prove (6.14), note that the bound therein certainly holds if we restrict integration to and . If either of the constraints on and fails, without loss of generality, say , then because and , we have
[TABLE]
since . This proves (6.14). The proof of (6.15) is similar and will be omitted. This completes the proof of (6.10) as well as of Prop. 3.2.
7 Proof of Lemma 4.1
Note that (4.3) is obvious. For , let us denote
[TABLE]
Then
[TABLE]
where
[TABLE]
To prove (4.4), it suffices to show that .
Note that in (7.1), fall into three regions: (0) ; (1) ; (2) . In case (0), the integrand in (7.1) is [math] by the independent increment properties of . In case (1), let and , while in case (2) let and , then
[TABLE]
with
[TABLE]
Since , we establish (4.4) once we show that there exists such that
[TABLE]
[TABLE]
from which we easily deduce that . Similarly, . On the other hand, by the local central limit theorem, Lemma B.1, we have
[TABLE]
Let and , and assume , then (7.4) becomes
[TABLE]
The integral in (7.6) is finite. Letting , the integral in (7.6) equals
[TABLE]
which proves that for .
In ,
[TABLE]
Therefore
[TABLE]
We separate the integral in (7.8) according to whether or . When , we have
[TABLE]
where we used the local central limit theorem to bound and made the change of variables and . When in (7.8), by Lemma B.3, we have
[TABLE]
where the last inequality follows from the same calculation as in (7). This proves that for and concludes the proof of Lemma 4.1.
8 Proof of Lemma 4.2
Proof of Lemma 4.2 (4.8)–(4.9). By definition, conditioned on ,
[TABLE]
To prove (4.8), it suffices to show that
[TABLE]
This follows from Lemma B.5. Indeed, we can decompose as the sum of independent random variables , where is such that , , for , and . From the definition of ,
[TABLE]
where we used the fact that and have the same symmetric jump probability kernel with respective rates and . Therefore is distributed as conditioned on . Similarly, for is distributed as conditioned on , and is distributed as conditioned on . Therefore Lemma B.5 applies. The proof of (4.9) is analogous and simpler.
Proof of Lemma 4.2 (4.10). Without loss of generality, assume that , and let . For , we have
[TABLE]
Therefore, conditioned on and ,
[TABLE]
where we have applied Lemma B.3 and used the local central limit theorem to bound for all and for all . This proves (4.10).
Proof of Lemma 4.2 (4.11). Without loss of generality, let and . We have
[TABLE]
In the integral above, and fall into three regions: (1) ; (2) ; (3) . In region (1), let , , , and similarly in regions (2) and (3), let and be the successive increments of the ordered variables. Let (1), (2) and (3) also denote the respective contributions to the integral in (8.2) from the three regions. Then for (1), we have
[TABLE]
and
[TABLE]
Therefore
[TABLE]
By similar considerations, we have
[TABLE]
We will show that (1), (2), (3) are all bounded by for some uniform in and .
For (1), we have
[TABLE]
where we used the local central limit theorem to bound and we applied Lemma B.4 with .
We can bound (2) by passing the absolute value in (8.4) inside. By Lemma B.1, for some for all , and for large, we have
[TABLE]
Therefore
[TABLE]
where the last integral is finite since integrating out and leads to a bound of the form . For the remaining term in (8.4), we have
[TABLE]
where we used (8.6), applied Lemma B.2, and made a change of variable . The integral in (8.8) is clearly finite when integrated over , since we can bound by . For , note that
[TABLE]
which is integrable over . Therefore the integral in (8.8) is finite, and together with (8.7), this shows that .
For (3), we have
[TABLE]
where we applied (8.6) to . Using Lemma B.3, we have
[TABLE]
Similarly,
[TABLE]
where we used the fact that , and made a change of variable . Thus we have proved , which concludes the proof of (4.11).
Appendix A Renewal estimates
Consider a renewal process on , where are i.i.d. with distribution for a bounded density on satisfying
[TABLE]
for some and . Let denote the -fold convolution of with itself, and let , as defined in (3.13), be the corresponding renewal density.
We prove in Lemma A.1 a special case of the continuous time version of Doney’s local limit theorem for renewal processes with infinite mean [D97, Thm. 3]. Note that [D97] allows a general regularly varying function in the right-hand side of (A.1). We stick to the narrower class, which suffices for our purposes, for the sake of a less cumbersome proof.
Lemma A.1
We have
[TABLE]
Lemma A.2
There exists a positive stable random variable with exponent , such that
[TABLE]
It is well known that
[TABLE]
where is a one-sided stable random variable of index . Note that , thus the normalisation is chosen here in such a way that {\mathbb{E}}[e^{-\lambda G}]=\exp\big{(}-\frac{c_{K}\Gamma(1-\alpha)}{\alpha}\lambda^{\alpha}\big{)}, , i.e., is times a “standard” one-sided stable random variable of index (see, e.g., [F66, Thm. XIII.6.2]). Since the characteristic function of decays faster than any polynomial at infinity, has a density , see, e.g., [IL71, p. 48]. As is a limit of non-negative random variables, we must have for , implying by continuity. Furthermore, for with some , see, e.g., [IL71, Thm. 2.4.1]. In particular, is bounded and uniformly continuous with for some . We have
[TABLE]
For the first equality, note that . The second identity uses well-known facts about the function.
[TABLE]
since the distribution of contains no atoms.
We will need the following uniform one-sided large deviation estimate.
Lemma A.3
We have for any sequence
[TABLE]
Proof. This follows from [Z99, Thm. 1] by specialising to the one-dimensional asymmetric case. Note that Zaigraev [Z99] attributes the result in the present case (one-dimensional situation, in the normal domain of attraction of a stable law) to Tkačuk [T73], which the authors unfortunately could not access.
Proof of Lemma A.1. Our proof follows more or less the scheme of [D97, Thm. 3], with [D97, Thm. 2] replaced by Lemma A.3. Even though we use Lemma A.1 in this paper only for , the proof is the same for all .
By a local limit theorem for sums of random variables in the domain of attraction of a stable law, e.g. [IL71, Thm. 4.3.1], we have
[TABLE]
where is the density of the one-sided stable random variable appearing as the limit in (A.4). Thus, we can find a continuous, strictly decreasing function with such that
[TABLE]
Obviously, is continuous and strictly decreasing with . Note that the function with is strictly decreasing, and . Define for . Observe that then is strictly decreasing and satisfies . Furthermore,
[TABLE]
proving that as , and
[TABLE]
Decompose
[TABLE]
We have
[TABLE]
where
[TABLE]
Since , we obtain from (A.10) that as .
Put , then we have
[TABLE]
since {\alpha nn^{\frac{1}{\alpha}}\big{(}x^{(t)}_{n}-x^{(t)}_{n+1}\big{)}}/{t}=\alpha n\big{(}1-\frac{n^{\frac{1}{\alpha}}}{(n+1)^{\frac{1}{\alpha}}}\big{)}\sim\alpha n\big{(}1-\big{(}1-\frac{1}{n+1}\big{)}^{1/\alpha}\big{)}\to 1, and hence
[TABLE]
The term on the right is an approximating Riemann sum and means , which tends to as . Thus, recalling (A.5) and the discussion above it, we have
[TABLE]
To bound , note that implies for sufficiently large. In particular, for such and , , so . Applying Lemma A.3 with , we see that there exists , and such that
[TABLE]
Note that
[TABLE]
which follows from (A.1) and the observation that is bounded from above by
[TABLE]
Therefore if the constant appearing in (A.12) is suitably increased, (A.12) holds for all . Thus for sufficiently large, we have
[TABLE]
which converges to [math] as .
Appendix B Random walk estimates
Lemma B.1
[Local central limit theorem]* Let with be a continuous time random walk on with jump rate and jump probability kernel , which is irreducible and symmetric with finite covariance matrix , . Let denote the transition probability kernel of at time . Then*
[TABLE]
and
[TABLE]
Proof. Since , where is real by the symmetry of , by inverse Fourier transform,
[TABLE]
For (B.2), see e.g. [S76, Prop. 7.9, Chap. II] where a discrete time version was proved. The proof for the continuous time version is identical.
Lemma B.2
Let , , and be as in Lemma B.1 without the symmetry assumption on . Then for any , there exists some depending only on such that
[TABLE]
Proof. Without loss of generality, assume that . By the local central limit theorem, there exists such that uniformly in and , we have . Then
[TABLE]
Lemma B.3
Let , , , and be as in Lemma B.1 so that is symmetric. Then there exist depending on , such that
[TABLE]
where the first inequality holds for all , , and the second inequality holds for all .
Proof. By the symmetry of , , and . Therefore,
[TABLE]
By irreducibility of , only at , and hence for any . By Taylor expansion, if is sufficiently small, then
[TABLE]
Therefore
[TABLE]
which implies that for . When , the same bound follows from the local central limit theorem.
Similarly,
[TABLE]
which follows by a change of variable for and the fact that . This implies for . When , the same bound follows from the local central limit theorem.
Lemma B.4
Let , and be as in Lemma B.1 so that is symmetric. Then there exist depending only on such that, for all and ,
[TABLE]
Proof. Note that
[TABLE]
By Lemma B.3, the first term in (B.7) is bounded in absolute value by
[TABLE]
which is clearly bounded by the RHS of (B.6).
For the second term in (B.7), we claim that
[TABLE]
which together with the fact that imply (B.6). Note that
[TABLE]
Clearly . For the upper bound, exactly as in (B.5), we can Taylor expand around for and bound uniformly for , which gives
[TABLE]
When , this implies (B.8). If , then (B.8) follows from the bound
[TABLE]
by Lemma B.3. The same argument applies when .
Lemma B.5
[Comparison of return probabilities]* Let , and be as in Lemma B.1 so that is symmetric. For , let , and let be an independent random variable distributed as conditioned on . Then*
[TABLE]
Proof. Let and . Since , by Fourier transform, (B.9) is equivalent to
[TABLE]
By symmetry of , and . Therefore to verify (B.10), it suffices to show that for each ,
[TABLE]
for all , with strict inequality for some .
Note that . By definition, , and hence
[TABLE]
By symmetry, , and hence
[TABLE]
where we applied Jensen’s inequality. Note that since is not identically equal to , for some choice of and , we have so that there is strict inequality in (B.12) for some . By symmetry,
[TABLE]
where we used . Plugging this bound into (B.12) then yields (B.11).
Appendix C Proof of Theorem 1.3
Let . Let be independent random walks on with the same symmetric jump kernel with finite second moments and with respective jump rates and . Then and are random walks with the same jump kernel and jump rates and , where for we used the symmetry of the kernel. The key observation is that
[TABLE]
which is a simple consequence of the fact that
[TABLE]
and the fact that
[TABLE]
Note that
[TABLE]
On the other hand, by (C.1),
[TABLE]
Therefore
[TABLE]
which implies the first inequality in (1.8).
Similarly, by (C.1),
[TABLE]
which implies the second inequality in (1.8).
To prove the first inequality in (1.9), let , recall that , and note that
[TABLE]
since is non-decreasing in , and by Theorem 1.1 and its analogue in dimensions shown in [BS09]. The proof of the second inequality in (1.9) is identical.
Acknowledgment We thank F.L. Toninelli for sending us the preprint [BT09] before publication. We thank the referee for a careful reading of the paper and helpful comments, and in particular, for bringing to our attention Theorem 1.3 and allowing us to include its elegant proof here.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BT 09] Q. Berger, F.L. Toninelli. On the critical point of the Random Walk Pinning Model in dimension d = 3 𝑑 3 d=3 , ar Xiv:0911.1661 v 2, 2009. To appear in Electron. Journal Probab.
- 2[B Gd H 08] M. Birkner, A. Greven, F. den Hollander. Collision local time of transient random walks and intermediate phases in interacting stochastic systems, EURANDOM Report 2008-49, 2008. http://www.eurandom.nl/reports/2008/049-report.pdf
- 3[BS 09] M. Birkner, R. Sun. Annealed vs quenched critical points for a random walk pinning model, ar Xiv:0807.2752 v 2, 2009. To appear in Ann. Inst. Henri Poincaré Probab. Stat .
- 4[DGLT 09] B. Derrida, G. Giacomin, H. Lacoin, F.L. Toninelli. Fractional moment bounds and disorder relevance for pinning models, Commun. Math. Phys. 287, 867–887, 2009.
- 5[D 97] R.A. Doney. One-sided local large deviation and renewal theorems in the case of infinite mean, Probab. Theory Rel. Fields 107, 451–465, 1997.
- 6[D 96] R. Durrett. Probability: Theory and Examples , 2nd ed., Duxbury Press, 1996.
- 7[F 66] W. Feller. An introduction to probability theory and its applications . Vol. II. John Wiley & Sons, Inc., New York-London-Sydney, 1966.
- 8[G 07] G. Giacomin. Random Polymer Models , Imperial College Press, World Scientific, 2007.
