Biased Random Walk on Spanning Trees of the Ladder Graph

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight c for the (vertical) rungs. Now take a random walk on that spanning tree with a bias β>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta >1$$\end{document} to the right. In contrast to other random graphs considered in the literature (random percolation clusters, Galton–Watson trees) this one allows for an explicit analysis based on a decomposition of the graph into independent pieces. We give an explicit formula for the speed of the biased random walk as a function of both the bias β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} and the edge weight c. We conclude that the speed is a continuous, unimodal function of β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} that is positive if and only if β<βc(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta < \beta _c^{(1)}$$\end{document} for an explicit critical value βc(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _c^{(1)}$$\end{document} depending on c. In particular, the phase transition at βc(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _c^{(1)}$$\end{document} is of second order. We show that another second order phase transition takes place at another critical value βc(2)<βc(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _c^{(2)}<\beta _c^{(1)}$$\end{document} that is also explicitly known: For β<βc(2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta <\beta _c^{(2)}$$\end{document} the times the walker spends in traps have second moments and (after subtracting the linear speed) the position fulfills a central limit theorem. We see that βc(2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _c^{(2)}$$\end{document} is smaller than the value of β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} which achieves the maximal value of the speed. Finally, concerning linear response, we confirm the Einstein relation for the unbiased model (β=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta =1$$\end{document}) by proving a central limit theorem and computing the variance.


Introduction
This paper studies a very specific model for transport in a disordered medium.Biased random walks in random environments and on random graphs have been investigated intensively over the last years.The most prominent examples are biased random walk on supercritical percolation clusters, introduced in [3] and biased random walk on supercritical Galton-Watson tree, introduced in [23].We refer to [5] for a survey.Another specific model which has found a lot of recent interest in the physics literature is the random comb graph, see [21], [27], [2], [13].In the presence of traps in the medium, there are often three regimes of transport, see for instance [21] and the references therein.
1.The Normal Transport regime for small values of the bias: the walk has a positive linear speed and, when subtracting the linear speed, it is diffusive.
2. The Anomalous Fluctuation regime for intermediate values of the bias: the walk still has a positive linear speed but the diffusivity is lost.
3. The Vanishing Velocity regime (aka subballistic regime): the speed of the random walk is zero if the bias is larger than some critical value, due to the time the random walk spends in traps.
The Normal Transport regime together with the Anomalous Fluctuation regime are also known as the ballistic regime.For biased random walk on supercritical Galton-Watson trees, these statements have been proved in [23].For biased random walks on supercritical percolation clusters, the existence of the critical value separating the ballistic regime from the Vanishing Velocity regime was shown in [14], whereas the earlier works [26] and [9] gave the existence of a zero speed and a positive speed regime.In the ballistic regime, one may ask about the behaviour of the linear speed as a function of the bias.Is the speed increasing as a function of the bias?This question is also interesting in disordered media without "hard traps", for instance Galton-Watson trees without leaves or the random conductance model (with conductances that are bounded above and bounded away from 0).In that case, there is no Vanishing Velocity regime.Monotonicity of the speed for biased random walks on supercritical Galton-Watson trees without leaves is a famous open question, see [24].We refer to [1] and [7] for recent results on Galton-Watson trees and [8] for a counterexample to monotonicity in the random conductance model.The Normal Transport regime for biased random walks on supercritical percolation clusters has been established in [14], [26], [9].Limit laws for the position of the walker have been investigated both in the Anomalous Fluctuation regime and in the Vanishing Velocity regime in several examples, see [18], [6], [16], [22], [12].For biased random walk on a supercritical percolation cluster, the conjectured picture of the speed as a function of the bias is as in Figure 1.3.However, there is no rigorous proof that the speed is a unimodal function of the bias.Here, we consider a random graph given as a (uniformly chosen) spanning tree of the ladder graph, parametrized by the density of vertical edges.In this case, we can give an explicit formula for the speed of the biased random walk, see (1.12).
In particular, we have an explicit critical value β (1) c

Definition of the model
To define our model of biased random walk on a random spanning tree, we need to introduce two things: (1) the random spanning tree and (2) the random walk on it.We begin with the random spanning tree.

Random spanning tree
Consider the two-sided infinite ladder graph L = V L , E L with vertex set V L = {0, 1}×Z and edge set E L = z m , h 0,m , h 1,m : m ∈ Z .
Here the are the horizontal edges and the are the vertical edges.See Figure 1.1.
For n ∈ N, let Let ST(L) denote the set of all spanning trees of L. That is, each t ∈ ST(L) is a subset of E L such that the graph (V L , t) is connected but has no cycles.Analogously, define ST(L n ).
Let c > 0 be a parameter of the model.We attach a weight weight(z m ) = c to each vertical edge z m and weight(h i,m ) = 1 to each horizontal edge h i,m .
Figure 1.1:A finite section of the simple ladder graph Denote by P c n the weighted spanning tree distribution on ST L n , that is By taking the limit n → ∞, we get (in the sense of convergence of finite dimensional distributions) By a standard recurrence argument, P is concentrated on connected graphs.That is, Let E denote the expectation with respect to P and let T be the generic random spanning tree with distribution P.
Although this is a rigorous and precise description of the model, it is not very helpful when it comes to explicit computations.In fact, for this purpose, it is more convenient to describe the random spanning tree in terms of the positions of its vertical edges (rungs) and its missing horizontal edges.Before we introduce the somewhat technical notation, let us explain the concept.The tree is completely specified if we know the positions of the missing horizontal edges and the positions of the vertical edges (rungs) in the tree.
• Let (H n ) n∈Z denote the horizontal positions of the right vertices of the missing rungs.Assume that the numeration is chosen such that • Denote by (W n ) the corresponding vertical positions of the missing edges.
• Between any two horizontal positions H n and H n+1 − 1 there is exactly one vertical edge in the tree.Denote the horizontal position of this edge by Roughly speaking, if we start from a rung at position V n there are a random number F n of positions to the right with both horizontal edges before the next horizontal edge is missing.That is, Going right from H n there are a random number F n of positions before the next rung at V n .That is Following the work of Häggström [17] for the case c = 1 and [19] for general c > 0, the (F n ) and (F n ) and (W n ) are independent random variables and • W n takes the values 0 and 1 each with probability 1/2 • F n and F n , n = 0, are geometrically distributed γ 1−α with parameter 1 − α with α defined in (1.2). Here and the geometric distribution with parameter a ∈ (0, 1] is defined by Note that α is a monotone decreasing function of c and α → 0 as c → ∞ (and hence the F n and F n tend to 0) and α → 1 as c → 0.
Clearly, (H n ) n∈Z is a stationary renewal process and the renewal times For n = 0, however, the gap G 0 is a size-biased pick of this distribution (waiting time paradox).That is, Roughly speaking, by symmetry, given G 0 , both the position of the origin and the position of the rung at V 0 are uniformly distributed among the possible values {H 0 , . . ., H 1 − 1} and are independent.In other words, given G 0 , the random variables H 0 and F 0 are independent and Note that is the difference of two independent and uniformly distributed random variables F 0 and −H 0 (given G 0 ).
Summing up, the random spanning tree T can be described in terms of the independent random variables (F n ), (F n ), (W n ) and by H 0 .The F n and F n , n = 0, are γ 1−α distributed while for F 0 and F 0 a somewhat different distribution needs to be chosen.(Since we are interested in asymptotic properties only, we would not even need to know the precise distributions of F 0 and F 0 .)Given these random variables, the positions of the rungs and the missing edges in T are given by: and

Random walk on the spanning tree
We now define random walk on T in the spirit of the random conductance model.Denote by P T the probabilities for a fixed spanning tree T .Furthermore, we let denote the annealed distribution and E its expectation.
Fix a parameter β ≥ 1 and attach to each edge in T a weight (conductance) For v ∈ T , we write the sum of the conductances of adjacent edges by Note that C(v) depends on T but this dependence is suppressed in the notation.
The random walk X = (X (1) , X (2) ) on T chooses among its neighboring edges with a probability proportional to the edge weight.That is, for {v, w} ∈ T .
Note that X (1) ∈ {0, 1} is the vertical position and X (2) ∈ Z is the horizontal position of X.

Main Results
For β > 1, this random walk has a bias to the right and we will see that it is in fact transient to the right and that the asymptotic speed exists.Since T is ergodic, the value of v does not depend on T and is a deterministic function of α and β.In this paper, we give an explicit formula for v and we discuss how v depends on β and on α.In particular, we see that v is strictly positive if and only if := 1/α, and that v is a unimodal function of β.For random walk on the full ladder graph, the speed is a monotone function of β.However, in the spanning tree, right of the vertical edges there are dead ends of varying sizes where the random walk can spend large amounts of time if β is large.Hence it can be expected that there exists a critical value β (1) (For a more intuitive description of these quantities, see (2.7), (2.8) and (2.9) in the proof).
Theorem 1.1 (Asymptotic Speed) Let β (1) , we have v(β) > 0 and the value of v is given by Note that β−1 β+1 is the asymptotic speed of random walk on Z with a bias β to the right.The remaining terms on the r.h.s. of (1.12) describe the slowdown due to (1) traps and (2) the lengthening of the path due to the need to pass vertical edges.Note that C > 0 and (s + − s − ) > 0.
Clearly, v(β) = 0 for β ∈ {1, 1/α}.To see that for each value of α ∈ (0, 1), β → v(β) is a unimodal function, it suffices to show that β → 1/v(β) is convex on (1, 1/α), and the readers can convince themselves from (1.12) that this is the case since β → 1/v(β) is a sum of convex functions.The explicit formula for the speed allows to investigate the dependence on the parameters β and α.Taking the limit of v as α → 0 (which amounts to c → ∞) in (1.12), we get .13)Note that this corresponds to the speed of a biased RW on a uniform spanning tree with all vertical edges.The uniform spanning tree can be chosen as follows: for each pair of horizontal edges h 0,k , h 1,k , a fair coin flip decides which one is retained.For this case, the formula (1.13) could be derived directly by a straightforward (but not short) Markov chain argument.
Does the speed increase as α increases, since there are less vertical edges to slow down the random walk?Or does increasing α mean that the traps get larger and the speed decreases?The latter effect should be stronger for large β and in fact we have which is positive if β < 3 and negative if β > 3. Hence, for fixed β, the value of the speed can either increase or decrease in the neighborhood of α = 0.
The next goal is to establish a central limit theorem in the ballistic regime, that is, in the regime where v(β) > 0. As we will need second moments, we have to restrict the range of By Theorem 1.1 of [15], the time the random walk spends in a trap has tails with moments of all orders smaller than but no moments larger than or equal to .Hence, the critical value β c for the existence of second moments is , second moments exist and this indicates that a central limit theorem should hold in this regime.Denote by N 0,1 the standard normal distribution.
. Then there exists a ς 2 ∈ (0, ∞) such that the annealed laws converge to a standard normal distribution, i.e.

L P X
(2) where β max is the value β for which v(β) is maximal.In fact, an explicit calculation gives + 164 β 6 + 118 β 5 + 72 β 4 + 34 β 3 + 14 As all coefficients are positive, we have In the case β ∈ β , we are still in the ballistic regime but second moments of the time spent in traps fail to exist.In fact, the pth moment exists if and only if p < .See [15].Hence we might ask if a proper rescaling yields convergence to a stable law.This, however, cannot be expected to hold since the time that the random walk spends in a random trap does not have regularly varying tails.See [15] for a detailed discussion.
Compare the situation to the random comb model (with exponential tails) (see [21, Fig. 3 and Fig. 9 (b)]): There are two critical values g 1 > g 2 > 0 for the drift g such that the following happens.
• For small drift 0 < g < g 2 , the random comb is in the Normal Transport regime (NT).That is, the speed is positive and the second moments are finite.The phase transition at g 2 is of second order, that is, the second moments diverge.Also for our model, the second moments of the time spent in traps diverges as β ↑ β c as can be read off from the explicit formula of the tails given in [15].
• For g 2 < g < g 1 , the random comb is in the Anomalous Fluctuation regime (AF).
The speed is positive but the second moments are infinite.The phase transition at g 1 is of second order, that is, the speed converges to 0 as g → g 1 .Also for our random walk on the random spanning tree, the speed decreases to 0 as β ↑ β c .
• For g 1 < g, the random comb is in the Vanishing Velocity regime (VV) where the speed is zero.
Also in the random comb model, the speed is an increasing function of the drift g in the NT regime (for exponential tails), as can be seen in [21, Fig. 9 (b)], and the speed is maximal at some g max > g 2 just as we have shown for our model in (1.17).
We come to the final goal of this paper.In the unbiased case β = 1, all moments of the time spent in traps exist and a central limit theorem should hold.Moreover, the variance σ 2 should be given by the Einstein relation where the second equality can easily checked by an explicit computation.We show that this is indeed true and that a quenched invariance principle holds true with this value of σ 2 .
Theorem 1.3 (Quenched Functional Central Limit Theorem) Let β = 1 and let σ 2 be given by (1.18).The process The histogram shows the endpoints as a result of 100 000 simulations of 1 000 000 steps of RWRE.The curve shows the (scaled) density of the normal distribution with variance 10 000 × 1+α 3+α as suggested by the CLT.

Organization of the paper
The rest of the paper is organized as follows.In Section 2, we study the random conductances in some more detail.We also decompose the spanning tree into building blocks and compute the expected times the random walks spends in these blocks.We put things together to get the explicit formula for the speed and prove Theorem 1.1.
In Section 3, we use a regeneration time argument to infer the central limit theorem in the ballistic regime.
In Section 4, we prove the Einstein relation (Theorem 1.3) by computing second moments.
2 Conductances Model and Proof of Theorem 1.1

Some more considerations on the spanning tree
In the spanning tree T , there is a unique ray (self avoiding path) from the left to the right.We denote the ray by Ray.We can enumerate the ray by the positive integers following it from (0, 0) [or (1,0) if (0,0) is not in the ray] to the right and by the negative integers going to the left.Let φ(i) = (φ (1) (i), φ (2) (i)), i ∈ Z, be this enumeration.
The basic idea is to decompose the random walk X into a random walk Y that makes steps only on Ray with edge weights given by (1.9).That is, if Y n is in the ray and also the position one step to the right, that is φ(φ −1 (Y n ) + 1) = Y n + (0, 1), is in the ray, then Otherwise these probabilities are both 1/2.Now assume that we attach random holding times to Y that model the times that X spends in the traps splitting from the ray.In most cases, of course, these holding times are simply 1 since there are no traps.
There are three kinds of traps: (c) A vertical edge splits from the ray.The ray has just made a step to the right and will make another step to the right.A vertical edge either splits to the top or the bottom of the ray.At the other end of this vertical edge, there are k horizontal edges to the right and l horizontal edges to the left.See Figure 2.3.It is tempting to follow a simple (but wrong) argument to compute the asymptotic speed of X: For a given point on the ray, compute the probability p that a trap starts at this point and compute the average time E[T ], the walk spends in a trap.Then take the speed .What is wrong with the argument is that the expected numbers of visits to a given point on the ray vary in a subtle way depending on the ray.Hence, we will have to argue more carefully to prove Theorem 1.1.However, there is a nice simplification of our model where this approach works and as a warm-up we present this here.
Consider the spanning tree T u that is defined just as T but the ray is {1} × Z.In other words, we would have W n = 0 for all n.In this case, there are only traps of type (c).Also, the random walk Y u on the ray is simply a random walk on Z with a drift β−1 β+1 .Since the gaps between vertical edges have distribution γ 1−α * γ 1−α * δ 1 they have expectation 1+α 1−α .Hence, the probability for a given vertical edge to be in Assume that the trap starts one step below (or above in the general case T ) the initial point of the random walk and then splits into l edges to the left and k edges to the right.Let T k,l be the time, the random walk on T u spends in the trap before it makes the first step on the ray.By Lemma 2.3 below, we have We still have to average over k and l to get, for β < 1/α, with s + and s − from (1.10).Summing up, we get that the biased random walk on T u has, for β < 1/α, asymptotic speed As indicated above, the computation of the speed v of random walk on T requires more care.We prepare for this in the next section by considering hitting times in the random conductance model.

Conductance method and times in traps
If the random walker on the random spanning tree enters a dead end of the tree (a trap) it takes a random amount of time to get back to the ray of the tree.The average amount of time spent in a trap is the key quantity for computing the ballistic speed of the random walk.In this section, we first present the (well-known) formula that computes the average time to exit the trap in terms of the sum of edge weights (2.4).Then we apply this formula to the three prototypes of traps: (a) a dead end to the right, (b) a dead end to the left and (c) a rung with dead ends to both sides.
Let G = (V, E) be a connected graph and assume that we are given edge weights C(x, y) = C(y, x) > 0 for all {x, y} ∈ E and C(x, y) = 0 otherwise.Let C(x) = y C(x, y) and let p(x, y) = C(x, y) C(x) , x, y ∈ V be the transition probabilities of a reversible Markov chain X on V .Assume that It is well known that the unique invariant distribution of this Markov chain is given by π(x) = C(x)/C(V ) for all x ∈ V .Let It is well known (see, e.g., [20,Theorem 17.52]) that Now we assume that there is a point x ∈ V with only one neighboring point y.Then Quite similarly, assume that there are two points x 1 , x 2 ∈ V each of which has only y as a neighbor.Let τ {x 1 ,x 2 } be the first hitting time of {x 1 , x 2 }.By identifying the two points and giving the edge to y the weight C(x 1 , y) + C(x 2 , y), we get from (2.5) We will need (2.6) when we compute the expected time that the random walk X on T spends in a trap before it makes one step on the ray from y to the left (say x 1 ) or the right (say x 2 ).
Lemma 2.1 (Trap of type (a)) Assume that for a given tree T , the trap starts one step right of the initial point of the random walk and that the trap has k ∈ N edges.Let T k be the time the random walk spends in the trap before it makes the first step on the ray (not counting this first step on the ray).Then Proof.We apply (2.6) with y the point on the ray where the trap splits off, x 1 and x 2 the two neighbouring points of y on the ray.The graph V consists of the points in the trap, y, x 1 and x 2 .The sum of edge weights is This, however, is the assertion.2 Lemma 2.2 (Trap of type (b)) Assume that for a given T , the trap starts one step left of the initial point of the random walk and that the trap has l ∈ N edges.Let T l be the time the random walk spends in the trap before it makes the first step on the ray (not counting this first step on the ray).Then Proof.We argue as in the proof of Lemma 2.1.Note that here the two edges on the ray have weights 1 and β, respectively.Hence

(Trap of type (c))
Assume that for a given T , the trap starts one step above (or below) the initial point of the random walk and then splits into l edges to the left and k edges to the right.Let T k,l be the time the random walk spends in the trap before it makes the first step on the ray (not counting this first step on the ray).Then We now compute Recall that and else. (2.9) Summing up, we have (2.10) Let us now consider the details of the spanning around the position of the walker.That is, we consider the part of T between two missing horizontal edges in which the walker is.Since we defined the position of the walker to be 0, this is the part of T between H 0 and H 1 (see Figure 1.2).Recall that F 0 is the distance of the rung to H 0 and F 0 is the distance of the rung to H 1 .Furthermore, V 0 is the position of the rung.Note that |W 1 − W 0 | = 1 if the missing horizontal edges are in alternating vertical positions and W 1 − W 0 = 0 otherwise.We first condition on these random variables and compute the edge weights.Later we average over F 0 , F 0 and |W 1 − W 0 |.

Define the events
for a, b ∈ N 0 , k = −a, . . ., b, σ = 0, 1.For each of these events, we compute the conditional expectation E 0 [τ 1 |A a,b,k,σ ] and then sum over all possibilities.
Here we compute (2.12) Denote by E 0 the annealed expectation for the random walk started in φ(0).Since C(h i,1 ) = β, i = 1, 2, we conclude due to (2.6) (2.13) Case 2. k > 0 or k = 0 and σ = 0.This is quite similar to Case 1, but since z −k ∈ T , we also have the additional edge weights (2.14) Case 3. k = 0 and σ = 1.This works as in Case 2, but in addition, the walker has to pass the edge z 0 .Here we only compute the additional time that it takes for passing this edge.Since the edge weights , and since C(z 0 ) = 1, we get with Now we sum up over the events A a,b,k,σ .Recall the distribution of 2) and recall that −H 0 and F 0 are independent are uniformly distributed on {0, . . ., G 0 − 1} given G 0 .Hence a Summing the terms for f 1 and f 2 , we get the expected value for τ 1 for the case where the ray stays either up all time or down all time.That is, by an explicit computation, we get with v u from (2.3).The last equality is a tedious calculation that is omitted here.However, it is clear that 1/v u must be the average holding time since the event we condition on is Now we come to the last term that describes the slow down of the walker due to the need to pass through z Concluding, we get the explicit formula (recall C and s + from (2.7), (1.11) and (1.10)) and the formula for the speed Plugging in the expressions for E 0 [τ 1 ] and v u we get (1.12) and the proof of Theorem 1.1 is complete.2 3 Ballistic central limit theorem, proof of Theorem 1.2 We follow the strategy of proof of Theorem 2 in [11] by introducing regeneration times (σ X n ) n∈N (in (3.9) below) and showing that σ X 2 − σ X 1 has a second moment.
Recall the definition of the random variables H n , n ∈ Z, from Section 1.2.Loosely speaking, H n is the right vertex of the nth horizontal bond right of the origin that has no matching horizontal bond.That is, either {(0, H n − 1), (0, H n )} is in the tree but {(1, H n − 1), (1, H n )} is not or vice versa.Let i n ∈ {0, 1} be such that e n := {(i n , H n − 1), (i n , H n )} ∈ T .Denote by T n the set of edges in T between H n and H n+1 shifted by H n and complemented by the information if the unique vertical edge between H n−1 and H n is in this set is in the ray or not.More formally, for an edge e = {(j 1 , h 1 ), (j 2 , h 2 )}, we define e Then Note that (T n ) n=1,2,... is i.i.d.
Let n 1 < n 2 < . . .be the times where X is on the ray: Then Y is a random walk on the infinite ray of T .
The effective resistance is maximal if all the vertical edges are in the ray (to the right of φ(n), at least).Since each vertical edge has the same conductance as its preceding horizontal edge, the effective resistance essentially doubles.We distinguish the cases (i) where φ(n − 1) and φ(n) are connected by a vertical edge and (ii) where they are connected by a horizontal edge.
In case (i), the edge between φ(n) and φ(n + 1) is horizontal, the edge between φ(n + 1) and φ(n + 2) is vertical and so on.Summing up, we get In case (ii), we have and C φ(n − 1), φ(n) = C φ(n), φ(n + 1) .That is, we get again Summarizing, this gives the lower bound in (3.4). 2 As Y has positive speed to the right, it passes each e n , n ∈ N at least once.We say that n is a regeneration point if Y passes e n exactly once.Note that for given T and n, the probability that n is regeneration point is Clearly, we have A n ⊂ A n,m for all m > n.Now let n 1 , . . ., n k ∈ N, n 1 < n 2 < . . .< n k .Note that A n l ,n l+1 , l = 1, . . ., k − 1, and A n k are independent events under P T 0 .Hence P T 0 n l is a regeneration point for all l = 1, . . ., k Then (σ X k+1 −σ X k ) k∈N are i.i.d.random variables (under the annealed probability measure).Along each elementary block T n the ray passes (#T n (1) + 1)/2 = H n+1 − H n horizontal edges and T n (2) vertical edges.Note that Hence, for all ζ < , we have E[T ζ n ] < ∞.In fact, the result of [15] gives a precise statement for the tails of the traps of type (a) (see Figure 2 be the occupation time of Y in (i, m).Given T , for each (i, m) on the ray, Y (i, m) − 1 is a geometric random variable with success probability p T (i, m) .Here p T (i, m) is the probability that Y will go to infinity before returning to (i, m).By Lemma 3.1, this probability is bounded below by Let γ p (k) = p(1 − p) k denote the weights of the geometric distribution on N 0 with success probability p. Hence for every ζ > 0, there is a constant Note that H n+1 − H n has moments of all orders, hence there exists Recall that τ n+1 − τ n is geometrically distributed.We use Hölder's inequality to infer (3.16) Having established the existence of second moments of the regeneration times, we can argue as in the proof of Theorem 2 in [11] to conclude the proof of Theorem 1. Recall that Ray denotes the (unique) self-avoiding path on T from −∞ to ∞.We may and will assume that X starts at a point chosen from the ray instead of (possibly) from a point inside a trap.Since all traps are of finite size, it is enough to prove the theorem for this initial position.For n ∈ N 0 , define the last time m ≤ n when X m was on the ray by That is, X waits at the entrances of the traps for X to come back to the ray.Since the depths of the traps are independent geometric random variables, it is easy to check that Hence, it is enough to show the theorem for X instead of X.
Note that X is symmetric simple random walk on Ray with random holding times.We now give a different construction of such a random walk that allows explicit computations.
Recall that φ(n) = (φ (1) (n), φ (2) (n)), n ∈ Z, is the enumeration of Ray, such that φ (1) (0) = 0 and φ (1) (−1) = −1.Let Y be symmetric simple random walk on Z. Then φ(Y n ) is symmetric simple random walk on Ray.For each k ∈ Z, there may or may not be a trap starting at φ(k).Let ν k denote the (random) distribution of the time that X spends in that trap at any visit of φ(k) before it makes a move on Ray.Let U k,i denote the time that X spends at its ith visit to φ(k) before it makes a step on the ray.Clearly, the U k,i are independent given (ν k ) k∈Z and U k,i has distribution ν k .Now we define Let m := E[ ν k ({ }) ] be the mean time before Y D takes its next step.In Theorem 2.10 of [4], a functional central limit theorem for our Y D was shown for the situation where the sequence (ν n ) n∈Z is i.i.d.In our situation, the (ν n ) n∈Z are not i.i.d.but are ergodic.In fact, they are a strongly mixing sequence as the random spanning tree T is made of i.i.d.building blocks.Taking a closer look at the proof of Theorem 2.10 in [4, Section 7.2], we notice that their assumption of independence is too strong and that ergodicity is perfectly enough to infer the statement of the theorem.Hence, by Theorem 2.10 of [4], we get that Proof.For n such that the vertex φ(n) is of degree 2 (that is, there is no trap adjacent to φ(n)), we have ν n = δ 1 since Y D makes its next step immediately.For n such that φ(n) has degree 3 and there is a trap consisting of k edges starting at φ(n), by (2.5), we have that the average holding time is By the ergodic theorem, we get m = lim Together with the above discussion, these lemmas finish the proof of Theorem 1.3. 2
(a) A horizontal edge splits to the right of the ray: The ray makes a step down (or up) and the trap consists of a number, say k, of horizontal edges to the right of the turning point.See Figure 2.1.(b) A horizontal edge splits to the left of the ray: The ray has just made a step down (or up) and now turns to the right again.The trap consists of a number, say l, of horizontal edges to the left of the turning point.See Figure 2.2.

S n := n k=0 U
Y k ,kand letY D n = Y k if S k−1 < n ≤ S k .Then φ(Y D n ) n∈N 0 and ( Xn ) n∈N 0 coincide in (quenched) distribution.Hence the proof of Theorem 1.3 amounts to showing that 1 √ σ 2 n φ (1) (Y D n ) tn t≥0(4.1)converges in P T -distribution in the Skorohod space D [0,∞) to a standard Brownian motion.

Lemma 4 . 1 φ ( 1 ) 2 n∈ZP[V n = k] = p 2 .
in P T -distribution in the Skorohod space D [0,∞) to a standard Brownian motion.It remains to compute m and to measure the effect of applying φ(1) to Y D .For almost all T , we havelim |n|→∞ Let p := P[T z k ] = P[V n = k for some n ∈ Z] = 1 − α 1 + α , k ∈ Z,be the probability that a given vertical edge z k is in the spanning tree.Recall that the fair coin flips (W n ) determine the vertical positions of the missing edges.That is, the horizontal edge h Wn,Hn is not in the tree T .Note that H n ≤ V n < H n+1 and that the vertical edge z Vn is in the ray if and only if W n = W n+1 .HenceP[Ray z k ] = n∈Z P[V n = k, W n = W n+1 ] =1By ergodicity, we get for almost all T 1 n # k ∈ {0, . . ., n} : z k ∈ Ray n→∞ k ∈ {−n, . . ., 0} : z k ∈ Ray n→∞ T ∩ ({0, 1} × {0, . . ., φ(1) (n)}) .8) Summing up, the set of regeneration points is minorized by a Bernoulli point process with success probability (β − 1)/2β that is independent of T .More explicitly, there exist i.i.d.Bernoulli random variables Z 1 , Z 2 , . . .independent of T such that P[Z 1 = 1] = (β − 1)/2β and such that Z n = 1 implies that n is a regeneration point (but not vice versa).Now let τ 1 < τ 2 < . . .denote the sequence of n's such that Z n = 1.Note that (τ k+1 −τ k ) k∈N are i.i.d.geometric random variables.Let .12)For each step of Y n , the random walk X n spends a random amount of time T n in a trap.For most points of the ray, this random variable is simply 1.Only at points adjacent to a vertical edge, there can be either one or two real traps with T n possibly larger than 1.Let n > t] ≤ Kt − for all t > 0.