Slow movement of a random walk on the range of a random walk in the presence of an external field

In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d\ge 5$$\end{document}). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect occurs as soon as a non-trivial bias is introduced. The proof applies a decomposition of the underlying simple random walk path at its cut-times to relate the associated biased random walk to a one-dimensional random walk in a random environment in Sinai’s regime. Via this approach, a corresponding aging result is also proved.


Introduction
In studying random walks in random environments, there is a particular focus at the moment on understanding the effect of an external field. Indeed, some quite remarkable results have been proved in this area. For instance, whereas adding a deterministic unidirectional bias to the random walk on the integer lattice Z d results in ballistic escape, the same has been shown not to hold for supercritical percolation clusters. Instead, the random environment arising in the percolation model creates traps which become stronger as the bias is increased, so that when the bias is set above a certain critical value, the speed of the biased random walk is zero [5,9,16]. This phenomenon, which has also been observed for the biased random walks on supercritical Galton-Watson trees [4,14] and a one-dimensional percolation model [1], is of physical significance, as it helps to explain how a particle could in some circumstances actually move more slowly when the strength of an external field, such as gravity, is greater [3].
For percolation on the integer lattice close to criticality, physicists have identified two potential trapping mechanisms for the associated biased random walk: 'trapping in branches' and 'traps along the backbone' [3]. More concretely, in high dimensions the incipient infinite cluster for bond percolation on the integer lattice is believed to be formed of a single infinite path-the backbone, to which a collection of 'branches' or 'dangling ends' is attached. If the dangling end is aligned with the bias, then the random walk will find it easy to enter this section of the graph, but very difficult to escape. Similarly, there will be sections of the backbone that flow with and sections that flow against the bias, and this will mean the random walk will prefer to spend time in certain locations along it.
Given that rigourous results for the incipient infinite cluster for critical bond percolation in Z d are currently rather limited, exploring the biased random walks on it directly is likely to be difficult. Nonetheless, the above heuristics motivate a number of interesting, but more tractable research problems, one of which will be the focus of this article. In particular, to investigate the effect of 'traps along the backbone', it makes sense to initially study how the presence of an external field affects a random walk on a random path. A natural choice for such a path is the one generated by a simple random walk on Z d , and it is for this reason that we pursue here a study of the biased random walk on this object.
To state our main results, we first need to formally define a biased random walk on the range of a random walk. Let (S n ) n∈Z be a two-sided random walk on Z d , i.e. suppose that (S n ) n≥0 and (S −n ) n≥0 are independent random walks on Z d starting from 0 built on a probability space with probability measure P. The range of this process is defined to be the random graph G = (V (G), E(G)) with vertex set V (G) := {S n : n ∈ Z}, (1) and edge set E(G) := {{S n , S n+1 } : n ∈ Z}.
Now, fix a bias parameter β ≥ 1, and to each edge e = {e − , e + } ∈ E(G), assign a conductance μ e := β max{e (1) − ,e (1) where e (1) ± is the first coordinate of e ± . The biased random walk on G is then the timehomogenous Markov chain X = ((X n ) n≥0 , P G x , x ∈ V (G)) on V (G) with transition probabilities where μ is a measure on V (G) defined by μ({x}) := e∈E(G):x∈e μ e . A simple check of the detailed balance equations shows that μ is the invariant measure for X . Note that, if β is strictly greater than 1, then the biased random walk X prefers to move in the first coordinate direction. If, on the other hand, there is no bias, i.e. β = 1, then the preceding definition leads to the usual simple random walk on G. Finally, as is the usual terminology for random walks in random environments, for x ∈ V (G), we say that P G x is the quenched law of X started from x. Since 0 is always an element of V (G), we can also define an annealed law P for the biased random walk on G started from 0 by setting Under this law, we can prove the following theorem, which shows that, unlike the supercritical percolation case, any non-trivial value of the bias leads to a slowdown effect. Theorem 1.1 Fix a bias parameter β > 1 and d ≥ 5. If X = (X n ) n≥0 is the biased random walk on the range G of the two-sided simple random walk S in Z d , then there exists an S-measurable random variable L n taking values in R d such that for any ε > 0. Moreover, (L n ) n≥1 converges in distribution under P to a random variable L β whose distribution can be characterised explicitly. Remark 1.2 The characterisation of L β that will be given in the proof of Theorem 1.1 readily yields that the distribution of L β log β is independent of β. (This fact can also seen on Fig. 2 below, which provides a sketch of the localisation point of X .) Thus, as the bias is increased, the biased random walk will be found closer to the origin.
To show that the unbiased random walk X on the graph G in dimensions d ≥ 5 is diffusive, it was exploited in [7] that the point process of cut-times of S, i.e. those times where the past and future paths do not intersect (of which there are infinite), is stationary. In particular, this observation allowed G to be decomposed at cut-points into a stationary chain of finite graphs, effectively reducing the problem into a onedimensional one. (Note that the same techniques are no longer applicable when d ≤ 4, as there are no longer an infinite number of cut-times for the two-sided random walk path.) This idea will again prove useful when proving Theorem 1.1, with the difference being that now it must be taken into account how the bias affects each of the graphs in the chain. Since the orientations of the graphs in the chain are random, it turns out that the one-dimensional model it is relevant to compare to is a random walk in a random environment in the so-called Sinai regime. It is now well-known that, because of the large traps that arise, a random walk in a random environment in Sinai's regime escapes at a rate (log n) 2 [15]. This will also be true for X with respect to the graph distance, but taking into account that S satisfies a diffusive scaling, we arrive at the log n scaling of the above result.
Another phenomenon occurring in Sinai's regime is aging-that is, the existence of correlations in the system over long time scales. One way of formalising this is to show that the asymptotic probability that the locations of the process on two different time scales are close does not decay to zero. Providing such a result for the biased random walk on the range of a random walk is the purpose of the following corollary. Note that the two time scales considered in this aging result, n and n h , where h > 1, are the same as those for which the analogous result is known to hold for the onedimensional random walk in a random environment in Sinai's regime (see [8], and also [17, Section 2.5]).

Corollary 1.3
In the setting of Theorem 1.1, it holds that The main difficulty in pursuing the line of reasoning outlined above is that the underlying simple random walk S has loops, and so it is necessary to estimate how much time the biased random walk X spends in these. If we start from a random path that is non-self intersecting, then there is not such a problem and, as long as the first coordinate of the random path still converges to a Brownian motion, verifying that a biased random walk exhibits a localisation phenomenon is much more straightforward. Thus, as a warm up to proving Theorem 1.1, we start by considering biased random walks on non-self intersecting paths. As a particular example, we are able to prove the following annealed scaling limit for the biased random walk on the range of a two-sided loop-erased random walk in high dimensions (see the end of Sect. 2 for precise definitions). It would also be possible to derive an aging result corresponding to Corollary 1.3 for this model, but since the proof would be identical (actually, slightly simpler), we choose not to present such a conclusion here. Theorem 1.4 Fix a bias parameter β > 1 and d ≥ 5. IfX = (X n ) n≥0 is the biased random walk on the rangeG of the two-sided loop-erased random walkS in Z d , then there exists anS-measurable random variableL n taking values in R d such that for any ε > 0. Moreover, (L n ) n≥1 converges in distribution under P to a random variableL β whose distribution can be characterised explicitly.
This article contains only two further sections. In Sect. 2 we explain the relationship between the biased random walk on a random path and a random walk in a onedimensional random environment, and prove Theorem 1.4. In Sect. 3, we adapt the argument in order to prove Theorem 1.1 and Corollary 1.3.

Biased random walk on a self-avoiding random path
The aim of this section is to describe how a biased random walk on a self-avoiding random path can be expressed as a random walk in a one-dimensional random environment. As we will demonstrate, this enables us to transfer results proved for the latter model to the former. To illustrate this, we will apply our techniques to the biased random walk on the range of the two-sided loop-erased random walk in dimensions d ≥ 5.
We start by introducing some notation. Suppose that S = (S n ) n∈Z is a random self-avoiding path in R d with S 0 = 0 built on a probability space with probability measure P. (To be precise, by self-avoiding we mean that S m = S n for any m = n.) The range of this process G = (V (G), E(G)) is defined analogously to (1) and (2), so that, by the self-avoiding assumption, G is a bi-infinite path. Assign edge conductances as at (3), and let X = ((X n ) n≥0 , P G x , x ∈ V (G)) be the associated biased random walk, i.e. the time-homogenous Markov chain on V (G) with transition probabilities As well as the quenched laws P G x , we can also define the annealed law for the process X started from 0 by integrating out the underlying random path S, cf. (4). Now let us define the particular random walk in a random environment of interest to us in this section. Firstly, the random environment ω will be represented by a random sequence (ω − n , ω + n ) n∈Z in [0, 1] 2 such that ω − n + ω + n = 1, and will again be built on the probability space with probability measure P. The random walk in the random environment will be the time-homogenous Markov chain X = ((X n ) n≥0 , P ω x , x ∈ Z) on Z with transition probabilities For x ∈ Z, the law P ω x is the quenched law of X started from x. Moreover, we can define an annealed law for X started from 0 by integrating out the environment, similarly to (4). To connect this model with the biased random walk on the random path introduced above, we suppose that the transition probabilities are defined by setting x . In other words, the quenched law of S X is the same as that of X . A corresponding identity holds for the relevant annealed laws. Importantly, it is also possible to connect the first coordinate of the random path with the potential of the random walk in the random environment. To be more concrete, let (S (1) n ) n∈Z be the first coordinate of (S n ) n∈Z , and ( n ) n∈Z be its increment process, i.e.
where ω is defined as in the previous paragraph, an elementary calculation yields log ρ n = − log β( + n+1 − − n ), where + n := max{0, n } and − n := − min{0, n }. Consequently, the potential (R n ) n∈Z of the random walk in a random environment, which is obtained by setting satisfies Hence, if the individual increments are small (note that we have so far not made any assumption that restricts the sizes of the n ), the first coordinate of S very nearly gives a (negative) constant multiple of the potential of the random walk in the random environment. (See Fig. 1 for an illustrative example of this connection.) The potential is of particular relevance when understanding the behaviour of the random walk in a random environment in the Sinai regime. In particular, by applying the fact that the potential converges to a Brownian motion, it is possible to describe where the large traps in the environment appear, and thus where the random walk prefers to spend time. Hence, at least when S satisfies a scaling result that incorporates a functional invariance principle in the first coordinate (and the increments of S (1) are bounded), it is possible to use the relationship between S (1) and R derived above to obtain the behaviour of the biased random walk on the random path.

Proposition 2.1 Fix a bias parameter β > 1. Suppose that S satisfies
t ) t∈R is a non-trivial multiple of a standard two-sided one-dimensional Brownian motion. Moreover, suppose that the increment process ( n ) n∈Z satisfies | 0 | < C, P-a.s., for some deterministic constant C. It then holds that the biased random walk X satisfies for any ε > 0, where L n is an S-measurable random variable that converges in distribution under P to a non-trivial random variable L β whose distribution can be characterised explicitly.
Proof Recalling the identity at (6), it is clear that the assumptions on S (1) imply the potential R converges when rescaled to a Brownian motion. Hence, by applying the proof of [17, Theorem 2.5.3] (and the following discussion), it is possible to demonstrate that the random walk in the random environment X satisfies for any ε > 0, where b(n) is an S-measurable random variable that converges in distribution under P to a non-zero and finite random variable b whose distribution can be characterised explicitly. Moreover, this convergence happens simultaneously with the convergence of the process in the case when ( n ) n∈Z is an i.i.d. sequence, this result follows from [10] and [15].) Setting The first equality here follows from the observation made above that the quenched law of S X is the same as that of X , and the inequality from (7). Finally, from the P-a.s. continuity of B, we deduce that the final expression is equal to 0, and hence we have proved the proposition.
To conclude this section, we note that the above result applies when S is a two-sided loop-erased random walk in dimension d ≥ 5. To introduce this model, we follow [12,Chapter 7]. First, fix d ≥ 5 and suppose that (ξ n ) n≥0 is a simple random walk on the integer lattice Z d . By the transience of this process, it is possible to define a sequence (σ n ) n≥0 by setting σ 0 = 0 and, for n ≥ 1, σ n := sup{m : ξ m = ξ σ n−1 +1 }. The looperasure of (ξ n ) n≥0 is then the process (S n ) n≥0 , where S n := ξ σ n . Roughly speaking, S is derived from ξ by erasing the loops of the latter process in a chronological order. To construct a two-sided version of the loop-erased random walk, we now suppose that we have two independent random walks on Z d started from the origin, ξ 1 and ξ 2 say. Let S 1 , S 2 be the loop-erasures of ξ 1 , ξ 2 , respectively, and set A := {ξ 1 [0,∞) ∩ ξ 2 [1,∞) = ∅}, which is an event with strictly positive probability in the dimensions that we are considering. On the event A, we then define (S n ) n∈Z by setting The process S under the conditional law P(·|A), where P is the probability measure on the space on which the two original random walks are defined, is the two-sided looperased random walk. Note that this is the same as the process defined in [11,Section 5].
Since S is a nearest-neighbour path in Z d , the corresponding increments ( n ) n∈Z are clearly bounded. Moreover, that (n −1/2 S nt ) t∈R converges to a d-dimensional Brownian motion is effectively proved in [11,Section 5]. Thus the assumptions of Proposition 2.1 are satisfied, and Theorem 1.4 follows.

Biased random walk on the range of simple random walk
The goal of this section is to develop the techniques of the previous section to deduce results about the biased random walk on the range of a two-sided simple random walk in high dimensions. As noted in the introduction, the main extra difficulty is that the underlying simple random walk S has self-intersections, and so the range is no longer a simple path. To circumvent this obstacle, rather than studying the biased random walk X directly, we start by considering the jump chain J obtained by observing X at the cut-points of S (see below for precise definitions). With J being a one-dimensional random walk in a random environment in Sinai's regime, we are consequently able to model our argument on an existing proof of localisation for such processes that involves studying the 'valleys' of the potential ( [17], see also [8]). However, some extra work is required to establish our main localisation result (Theorem 1.1), which can be summarised as follows: (i) Firstly, we need to check that the associated potential has Brownian scaling (this is an assumption in [17]). To do this, we use the connection between random walks and electrical networks, scaling and continuity properties of S, and the distribution of the cut-times of S (see Lemma 3.1). (ii) Secondly, the random environment that arises is non-elliptic (i.e. its transition probabilities are not uniformly bounded from below). Since ellipticity is assumed in [17], we need to be careful about controlling the effect of small transition probabilities (see (14) and the proof of Lemma 3.2). (iii) Thirdly, to ensure that the behaviour of the jump chain J suitably wellapproximates the behaviour of the original biased random walk X , we are required to provide an estimate for the time X spends in loops of the graph (see Lemma 3.3). Note also that, it is in order to have the flexibility to accommodate the time in loops into the proof of the main localisation result that we prove in Lemma 3.2 a slightly sharper estimate for J than is necessary in the one-dimensional case.
The final step of the argument for establishing Theorem 1.1 involves transferring results back into Euclidean space. For this, we again apply various properties of the path of the random walk S. Similar adaptations to [17] further enable us to prove the corollary regarding aging.
We proceed by introducing the notation that will allow us to study the biased random walk observed at the hitting times of cut-points. Let be the set of cut-times for S. This set is infinite, P-a.s., and so we can write T = {T n : n ∈ Z}, where · · · < T −1 < T 0 ≤ 0 < T 1 < T 2 < . . . . The corresponding cut-points will be denoted C n := S T n . Define the hitting times by X of the set of cut-points C := {C n : n ∈ Z} by setting and, for n ≥ 0, Denoting by π the bijection from Z to C that satisfies π(n) = C n , we then let J = (J n ) n≥0 be the Z-valued process obtained by setting J n := π −1 X H n .
In particular, J records the indices of the successive cut-points visited by the biased random walk on the range of the random walk. The parallel with Sect. 2 (and [17]) is that J is a random walk in a random environment. Note that, unlike in Sect. 2, we allow the possibility that J sits at a particular integer for multiple time-steps, and to capture this we will now write the environment as (ω − n , ω 0 n , ω + n ) n∈Z , where ω ± n are defined to be the jump probabilities from n to n ±1, and ω 0 n is the probability of remaining at n. In particular, it is a simple calculation (cf. [7, (12)]) to check that where R eff is the effective resistance operator on V (G) corresponding to the given conductances. (See [13,Chapter 9] for background on the connection between random walks and electrical networks.) As in the previous section, we will write ρ n := ω − n /ω + n and define from this a potential (R n ) n∈Z as at (5). Our first step is to show that this potential satisfies a functional invariance principle.
Proof We will start by showing that, similarly to (6), (R n ) n∈Z is close to a constant multiple of the first coordinate of the cut-time process (C (1) n ) n∈Z . We can write Noting that the effective resistance between two vertices is always less than the graph distance between them in the graph when edges are weighted according to their individual resistances (this is a simple application of Rayleigh's monotonicity principle, e.g. [13, Theorem 9.12]), it is possible to deduce that Furthermore, since any path from C n to C n+1 must contain the edge {S T n , S T n +1 }, it also holds that Tn +1 } . Thus, By a simple time-change, the estimate of the previous paragraph will allow us to prove the lemma from the obvious invariance principle for the first coordinate of the random walk, In particular, an ergodic theory argument implies that n −1 T n → E(T 1 |0 ∈ T ) ∈ [1, ∞) as |n| → ∞ almost-surely with respect to P(·|0 ∈ T ) (see [7,Lemma 2.2]), and that the same holds true P-a.s. can be shown by applying the relationship between the conditioned and unconditioned measures of [6, (1.11)]. It readily follows that and so to complete the proof it will suffice to show that, when rescaled by n −1/2 , the right-hand side of (12) converges to 0 in P-probability. To prove this, first observe that since n −1 T n converges P-a.s., we further have

P-a.s.
Hence we obtain that, for any ε, δ > 0, where τ := E(T 1 |0 ∈ T ), and we apply (13) to deduce the equality. By the P-a.s. continuity of Brownian motion, the upper bound here converges to 0 as δ → 0, which gives the desired conclusion.
To introduce the valleys of the potential, which play an important role in determining the behaviour of the random walk, we follow the presentation of [17,Section 2.5] .  A triple (a, b, c) The integer b is said to be the location of the base of the valley, and the depth of the valley is defined to be equal to If (a, b, c) is a valley of R and a < d < e < b are such that then (a, d, e) and (e, b, c) are again valleys, obtained from (a, b, c) by a so-called left-refinement. One can similarly define a right-refinement. Now, for n ≥ 2, let so that (a (n), b (n), c (n)) is a valley of R of depth ≥ log n. By taking a successive sequence of refinements of (a (n), b (n), c (n)), we can find the 'smallest' valley (a(n), b(n), c(n)) with a(n) < 0, c(n) > 0 and depth ≥ log n. (Although the quantity b(n) is defined differently here to how it was in the previous section, it will play a similar role in describing the point of localisation of the biased random walk.) For δ > 0, the smallest valley (a δ (n), b δ (n), c δ (n)) with depth ≥ (1 + δ) log n is defined similarly.
In much of what follows, it will be useful to assume that the random environment satisfies certain properties. To this end, we define A(n, K , δ) to be the subset of the probability space on which the random walk S is built where: We note that Indeed, if we eliminate the final property, then this is essentially a restatement of [17, (2.5.2)], and only depends on the fact that R converges when rescaled to a Brownian motion. That we can incorporate the final property was verified in the proof of the previous lemma (with n in place of K (log n) 2 + 1).
Before continuing, we first observe that on A(n, K , δ) it is possible to derive a lower bound for the jump probabilities of the process J . More specifically, we claim that on the set in question To prove this, we apply the inequality at (10) and the straightforward estimate Since a similar lower bound also holds for log ω − n , the statement at (14) follows from the final defining property of A(n, K , δ).
The following lemma outlines some first properties of the jump process J defined at (8). a bias parameter β > 1 and d ≥ 5. For δ small and K ∈ (0, ∞), there exists a finite integer n 0 (K , δ) such that: if n ≥ n 0 (K , δ), then on A(n, K , δ) the jump process J satisfies

Lemma 3.2 Fix
and also Proof For the first estimate, let us assume that b(n) > 0. (The case b(n) < 0 is similar, and the case b(n) = 0 is trivial.) It is then a simple exercise in harmonic calculus to check that where the inequality takes account of the fact that J could start from 0 or from 1 if X starts from 0. By applying the estimates for the effective resistance between cut-times from (10) and (11), and the bounds that are known to hold on A(n, K , δ), it follows that Subsequently, using the estimate for R m at (12) (and the defining properties of A(n, K , δ) again), we obtain for δ suitably small and n ≥ n 0 (K , δ). Note that the fourth inequality here is a consequence of the assumption that b(n) = b δ (n). Furthermore, if we defineJ to be the jump chain J reflected at a δ (n), then by repeatedly applying a first-step decomposition forJ , similarly to the proof of [17, Lemma 2.1.12], it is possible to check that the expected time it takes this process to hit 1 when started from 0 is given by where we apply the definition of the potential and (9) .
In turn, this expression can be bounded from above by again for δ chosen suitably small and n ≥ n 0 (K , δ), where we have used the lower estimate for the transition probabilities from (14) and the defining properties of A(n, K , δ). In particular, that R m−1 − R m−1−k ≤ (1 − δ) log n for any m, k in the range considered is an easy consequence of the second property of A(n, K , δ). It is thus possible to conclude that for small δ and n ≥ n 0 (K , δ), which completes the proof of (15).
To prove (16), we first observe that a similar argument to above yields Similarly, Hence, ≥ P G J 0 =b(n) (J returns to b(n) at least n times before hitting {a δ (n), c δ (n)}) for δ small and n ≥ n 0 (K , δ). Since we also have that J hits b(n) before {a δ (n), c δ (n)} with probability no less than 1 − n δ/2 , the result follows.
We now provide an upper estimate for the growth of hitting times.
Proof By simple properties of conditional expectation and the Markov property for X (under the quenched law), we have that Standard estimates for random walks on graphs in terms of volume and resistance (see [2], Corollary 4.28, for example) imply that the inner expectation satisfies Thus, on the set {|J m | ≤ K (log n) 2 } it holds that (here we have applied (10) and the fifth property of A(n, K , δ)), and so for small δ and n ≥ n 0 (K , δ). In fact, because one can similarly check that E G 0 (H 0 ) ≤ 2dβn 6δ 4 , it is possible to replace H n 1−δ 2 − H 0 by just H n 1−δ 2 in the above inequality. Consequently, Chebyshev's inequality yields In conjunction with (16), this implies the result.
All the pieces are now in place to prove Theorem 1.1 with Proof of Theorem 1.1 As in the proof of [17, Theorem 2.5.3], the proof strategy will be to show that X hits C b(n) before time n and then stays there for a sufficient amount of time. For the majority of the proof, we will assume that A(n, K , δ) holds, with δ small and n ≥ n 0 (K , δ).
To show that X hits C b(n) sufficiently early, we first observe that, by construction Hence, Lemmas 3.2 and 3.3 imply for small δ and n ≥ n 0 (K , δ). Now, since J is the process X observed at hitting times of the cut-point set C, we are immediately able to deduce from (17) that

It follows that
whereX is the random walk on the weighted graphḠ with vertex set and edge conductances given byμ e = μ e (recall that μ e is the conductance of the edge e in the original graph G). To estimate the latter probability, we study the invariant measureμ ofX , which is defined analogously to μ. If k ∈ [T m , T m+1 ], then , then by applying (12) and the estimates that are known to hold on A(n, K , δ) it is possible to check that, for k ∈ [T m , T m+1 ],μ Similarly, one can obtainμ Since andμP G =μ, whereP G is the transition matrix ofX , (so that fP l G = f for any l,) it follows that Thus, for small δ and n ≥ n 0 (K , δ).
We have thus reduced the problem to showing that lim δ→0 lim sup However, simultaneously with the convergence of (d 1/2 (log n) −1 S (log n) 2 t ) t∈R to a standard two-sided d-dimensional Brownian motion (B t ) t∈R with B 0 = 0, one can check that (log n) −2 b(n) converges in distribution to some random variable b ∞ that takes values in (−∞, ∞) (cf. the discussion following [17, Theorem 2.5.3]). Moreover, as was noted in the proof of Lemma 3.1, n −1 T n converges P-a.s. to a deterministic constant in [1, ∞). Combining these results readily yields (18).
Let us now verify the statement of Remark 1.2 that L β log β, where L β is the distributional limit of L n , has a distribution that is independent of β. Let (B t ) t∈R be the standard two-sided Brownian motion that appears as the scaling limit of the process (d 1/2 (log n) −1 S (log n) 2 t ) t∈R . Since b(n) is the location of the base of the smallest valley of the process (R m ) m∈Z that surrounds 0 and has depth log n, it is possibleto check that b ∞ , as defined in the previous proof, is the location of the base in distribution, whereb ∞ is the location of the base of the smallest valley of (B (1) t ) t∈R which surrounds 0 and has depth 1, and so the claim does indeed hold true. This discussion is perhaps most clearly understood in conjunction with Fig. 2, which provides a sketch of the localisation point for the biased random walk on the range of a random walk (in this figure, it is supposed that the first coordinate of R d is measured along the vertical axis). In particular, it illustrates that after n steps, the biased random walk will be found in the closest trap to the origin from which it takes at least log n/ log β steps against the bias to escape.
To complete the article, we derive the aging result of Corollary 1.3.
tτ ) t∈R that surrounds 0 and has depth θ (so that b ∞ (1) = b ∞ , as defined previously). Applying also the P-a.s. convergence of n −1 T n to τ , we obtain lim ε→0 lim n→∞ P X n h − X n log n < ε = lim where the second equality is a consequence of the almost-sure injectivity of the map t → B t in the dimensions we are considering. A simple scaling argument shows that this final expression is equal to P(b ∞ (h) =b ∞ (1)), whereb ∞ (θ ) is the location of the base of the smallest valley of the process (B (1) t ) t∈R that surrounds 0 and has depth θ . This probability was evaluated explicitly in the proof of [8,Theorem 2.15], giving the desired result.