# Diffusion and Superdiffusion in Lattice Models for Colliding Particles with Stored Momentum

- 75 Downloads

## Abstract

We introduce two discrete models of a collection of colliding particles with stored momentum and study the asymptotic growth of the mean-square displacement of an active particle. We prove that the models are superdiffusive in one dimension (with power law correction) and diffusive in three and higher dimensions. In two dimensions we demonstrate superdiffusivity (with logarithmic correction) for certain anisotropic initial conditions.

## Keywords

Superdiffusion Momentum transport Random walk with memory## Mathematics Subject Classification

82C41## 1 Introduction

*d*canonical unit vectors. An active particle is placed at the origin and is also assigned a momentum vector. In both models jumps occur in continuous time at rate one and at jump times the active particle first moves in the direction of its momentum vector. In the first model (M1), upon reaching the neighbouring site the active particle falls asleep and wakes up the sleeping particle at that site, and the motion is then repeated for the new active particle (see Fig. 1). In the second model (M2), upon reaching the neighbouring site the active particle remains awake with probability \(\tfrac{1}{2},\) or else it falls asleep and the particle at the site awakens. Alternatively one can consider the process as a random walker carrying an arrow. At jump times the walker moves according to the direction of the arrow in its hand and after taking a step the walker either swaps the hand and site arrows with probability 1 (M1 model) or probability \(\tfrac{1}{2}\) (M2 model). The mean-square displacement of the active particle will be denoted

*t*. This expectation is taken over the random i.i.d. initial configuration of the momentum vectors.

For \(d=1,\) both models are easy to understand. In the M1 model the position of the active particle is ballistic regardless of the initial condition (Theorem 1.6) and this can be proved through a simple case-by-case analysis. For i.i.d. initial momentum configurations, the M2 model is equivalent to the *true self-avoiding walk* (TSAW) with strict bond repulsion [14, 16] for which exact \(t^{4/3}\)-scaling for the mean-square displacement is known (Theorem 1.6). A motivation for the models M1 and M2 is that they can be seen as natural generalisations of the one-dimensional TSAW to higher dimensions. The TSAW with bond repulsion (BTSAW) was introduced by the third author in [14], modifying an earlier TSAW model with site repulsion due to Amit et al. [3]. The BTSAW is a discrete time random walk \(X_t\) with memory whose jump probabilities are determined by the local times on the edges incident to the walker’s position. In a particular instance of the model, the probability of jumping from vertex *x* to a neighboring vertex *y* is proportional to \(\exp (-g\cdot \ell _t(x,y)),\) where *g* is a parameter and \(\ell _t(x,y)\) is the number of jumps along the edge (*x*, *y*) (in either direction) that have occurred before time *t*. Tóth proved a limit theorem of Ray-Knight type for \(X_t\) and a limit law for \(A^{-2/3}X_{t}\) observed at a geometric random time *t* with mean *A*, showing that the walk is superdiffusive with \(X_t\) scaling like \(t^{2/3}.\) In the limiting case of strict repulsion (\(g = \infty \)) there is a stationary state of the local time profile as viewed from the position of the walker, in which the motion was described in [16] as an exploration of the interface between dual systems of coalescing simple random walks (SRWs).

Beyond one dimension, however, we are unable to analyse the M1 and M2 models exactly, and so we introduce an elliptic term into the model generators (Definition 1.1) to make them tractable. In the resulting versions of the models, which we name \(\text {M1}_\varepsilon \) and \(\text {M2}_\varepsilon ,\) at a small rate the walker will choose to ignore the arrow configuration and take a step uniformly at random. For \(d \ge 3\) we are able to show that both new models have mean-square displacements that scale linearly with time (Theorem 1.10). The case \(d = 2\) is more challenging: we are able to prove upper bounds on the diffusivity of order \(t \log t\) for all i.i.d. drift-free initial conditions and a superdiffusive lower bound of order \(t \sqrt{ \log t}\) for certain anisotropic initial momentum configurations (Theorem 1.11).

The mechanism driving the superdiffusion in the models is the persistence of correlations in the configuration of the arrows. Upon returning to a region the walker has visited previously, the collection of site arrows will be positively correlated with their state on the previous visit. Therefore when the walker returns to a region, it tends to see a similar bias in the local configuration of arrows, and therefore receives a similar drift, when compared to the last visit. This effect is sufficient to cause superdiffusion in one and two dimensions. In three and higher dimensions the underlying dynamics of the walk are transient and so the correlations in the environment of arrows do not influence the asymptotic growth of the mean-squared displacement.

This mechanism is also present in the continuous Brownian polymer [6, 13, 15], which is a continuum model that shows the same superdiffusive behaviour for \(d=1\) and 2 and diffusive behaviour for \(d \ge 3.\) The self-repellent Brownian polymer (SRBP) is a diffusion with memory, in which the drift term is the negative gradient of a mollification of the occupation measure of the process (for example by convolution with a Gaussian). Thus it is a continuum analog of the TSAW. Indeed in [6] the SRBP and TSAW in dimension \(d \ge 3\) are shown to have diffusive scaling limits using exactly parallel methods.

Apart from the direct connection between our model M2 and the one-dimensional TSAW, and the matching dependence of the bounds and conjectures for the long-time asymptotic behaviour on the dimension between our models and the TSAW and SRBP, we mention the TSAW and SRBP because they were studied in [6, 13, 15] using the *resolvent method* that was originally developed in [8, 9]. We also use the resolvent method as the main technical tool in this paper, converted appropriately to our lattice-based models. The method gives us bounds on the Laplace transform of *E* and proceeds as follows. First the growth of *E*(*t*) is connected to the growth of the compensator of the random walk via a property called Yaglom reversibility (Lemma 3.1). This means that the walk is unchanged in law when both space and time are reversed. Next the Laplace transform of the compensator is connected to the symmetric and anti-symmetric parts of the generators of the model dynamics via a variational formula (Eq. 3.1). The key is that under the symmetrised dynamics, the active particle takes random walk steps independently of the environment of arrows, and hence can be analysed exactly. An upper bound on the Laplace transform of *E* is obtained by discarding the contributions from the anti-symmetric part in the variational formula (Sect. 4). Obtaining a lower bound is more challenging and the strategy is to restrict the variational formula to a subspace of linear functionals over which exact computations can be carried out (Sect. 5).

### 1.1 Notation

Before stating our main results, we need some notation. For \(d \ge 1,\) define \(\mathbb {Z}^d_\star = \mathbb {Z}^d \cup \{\star \},\) where \(\star \) is an abstract symbol acting as a placeholder for the active particle (the hand). Let \(\mathscr {E} = \{ \pm e_1, \ldots , \pm e_d\}\) be the canonical unit vectors in \(\mathbb {R}^d\) and \(\varOmega = \mathscr {E}^{\mathbb {Z}^d_\star }.\) The elements of \(\varOmega \) represent the environment of site arrows *as seen from the position of the walker*, together with the information about the arrow in the walker’s hand. The evolution of the environment as seen by the walker is described by a continuous time jump process, \(\left( \eta _t\right) _{t \in \mathbb {R}},\) taking values in \(\varOmega .\)

*i*th component of \(\omega (x) \in \mathbb {R}^d.\) Define the

*shift*maps on \(\varOmega \) by

*swap*map

*step-then-swap*at rate 1 is given by

### Definition 1.1

*Generators*) For \(d \ge 1\) the generators for the process \(\eta \) in the M1 and M2 models respectively are defined to be

*U*be the generator

### Remark 1.2

Technically it is redundant to swap the hand and site arrows before and after a step in the M2 model, since the composition of two random swaps is equal in law to one random swap. The rule is presented in this way to simplify the form of \({\widetilde{T}}\) when we take its adjoint.

*drift-free*, and to this end we will define, \(\mu _{p},\) to be the distribution given by

*p*has all its components equal to \(d^{-1}\) we will call \(\pi _p\)

*isotropic*and otherwise we will call \(\pi _p\)

*anisotropic*. If

*p*equals one of the canonical unit vectors, then we will call \(\pi _p\)

*totally anisotropic*. Observe that, since \(\varepsilon > 0,\) the dynamics under \(G_\varepsilon \) and \({\widetilde{G}}_\varepsilon \) are not constrained to a one-dimensional subspace under the totally anisotropic initial conditions.

### Proposition 1.3

(Stationarity) For every \(p \in \mathscr {P},\) the product measure \(\pi _p\) is stationary for all of the generators in Definition 1.1.

### Proof

Immediate from the fact \(\tau _\star ,\)\(\tau _e\) and \(\sigma \) are bijections on \(\varOmega \) and preserve product measures. \(\square \)

### Remark 1.4

(Conservation of momentum) The local sum of the arrows is conserved by the dynamics in both models. This is analogous to the transport and exchange of momentum in a system of colliding particles such as a hard-sphere gas.

### Remark 1.5

(Entropy production) In model M1 the embedded jump chain is completely determined by the initial environment, so the sequence of environments as seen by the walker can be thought of as a dynamical system equipped with an invariant measure. Whether the entropy of this system is zero or non-zero depends on whether the range of the walk grows sublinearly or linearly. In model M2 there is extra randomness at every jump for which \(\omega (0) \ne \omega (\star ),\) so we would expect model M2, considered as an invariant measure on the shift space \(\varOmega ^\mathbb {N},\) to have positive entropy.

Our first result characterises the behaviour of *E* in the simplest case when \(d=1.\)

### Theorem 1.6

- (i)For any deterministic initial configuration of arrows, the dynamics of the M1 model are ballistic. In particular$$\begin{aligned} \liminf _{t \rightarrow \infty }\frac{|X_t|}{t} \ge \frac{1}{3}, \; \text {with probability }1. \end{aligned}$$
- (ii)With \(\pi = \pi _{1},\) the M2 model is the TSAW [14]. In particular we have constants \(C, D > 0\) such that$$\begin{aligned} Ct^{4/3} \le E(t) \le Dt^{4/3}. \end{aligned}$$

The first part follows by an easy case-by-case analysis. The second follows from noticing that the one-dimensional environment of arrows can be viewed as the gradient of a local time profile. The proofs are presented in Sect. 2.

*E*directly, but prove results for the asymptotic singularity of the Laplace transform

### Theorem 1.7

### Remark 1.8

(Discrete time) It is a standard calculation to show the asymptotic behaviour of \({\widehat{E}}(\lambda ),\) and hence the statement of the main results, is exactly the same for the discrete-time version of the models.

### Remark 1.9

(Constants) The constants in the theorems are not sharp.

*E*, however the upper bound is valid and comes from the relationship

*E*(

*t*) for the one-dimensional TSAW, so neither bound is sharp. Notice that adding the randomising effect \(\varepsilon U\) to the generator of

*G*completely destroys the ballistic growth seen in the one-dimensional M1 model.

In three and more dimensions, transience of SRW is enough to prove that the walker does not behave superdiffusively. The proof of this, as well as the upper bounds for \(d=1\) and 2, follows by comparing the system to random walk in random scenery. On the other hand, subdiffusivity is excluded by the property of Yaglom reversibility of the generators (see Lemma 3.1 and [4, 13, 17]). We therefore conclude diffusive scaling (\(E(t) \asymp t\)) when \(d \ge 3\):

### Theorem 1.10

The two-dimensional case is the hardest to analyse. We are able to prove upper bounds of the order of \(t\log t\) for both the \(\text {M1}_\varepsilon \) and \(\text {M2}_\varepsilon \) models started from any initial product measure \(\pi _p.\) In the totally anisotropic case where \(\pi _p\) has \(p = (1,0)\) or (0, 1)—recall Fig. 2—a lower bound can be proved of order \(t \sqrt{\log t}.\)

### Theorem 1.11

- (i)Let \(\pi = \pi _p,\) for any \(p \in \mathscr {P}.\) Then for both the \(\text {M1}_\varepsilon \) and \(\text {M2}_\varepsilon \) models we have a constant \(D > 0\) such that$$\begin{aligned} {\widehat{E}}(\lambda ) \le D \lambda ^{-2}\log (\lambda ^{-1}). \end{aligned}$$
- (ii)(Totally anisotropic) If \(p = (1,0)\) or (0, 1) then there exists a constant \(C>0\) such that for both the \(\text {M1}_\varepsilon \) and \(\text {M2}_\varepsilon \) models$$\begin{aligned} C \lambda ^{-2} \sqrt{\log (\lambda ^{-1})} \le {\widehat{E}}(\lambda ). \end{aligned}$$

We are unable to obtain a superdiffusive lower bound in the non-totally anisotropic case—that is, \(p \ne (1,0)\) or (0, 1)—however it should be possible to derive a bound of \(t \log \log t\) if the computations in [15] could be replicated. The obstruction to this is that we are unable to analyse a transition kernel of SRW on a specific graph in sufficient detail (see the final part of Sect. 6). At present all we can say is that *E*(*t*) scales at least linearly, by Lemma 3.1.

In line with [15] we make the following predictions about the true asymptotic growth of the mean-squared displacement in two dimensions:

### Conjecture 1.12

Although, based on Theorem 1.6, we might expect the \(\mathrm {M1}_\varepsilon \) model to be more superdiffusive than the \(\mathrm {M2}_\varepsilon \) model, the fact that the asymptotic bounds in Theorems 1.7, 1.10 and 1.11 and their subsequent proofs are insensitive to the choice of models suggests that the true asymptotic rates ought to agree. The exponents in this conjecture are derived in [15] using the non-rigorous Alder–Wainwright scaling argument [1, 2, 5]. Notice that we expect the logarithmic exponent to differ from the isotropic case only in the completely anisotropic case.

Scaling exponents the same as those known or conjectured for TSAW, SRBP and the models in this paper also appear in studies of interacting particle systems in the KPZ universality class. Indeed, the resolvent method has been used by a number of authors to prove such results. See for example [11], which deals with diffusivity of a large class of lattice particle systems having invariant product measures. Although similar techniques are applicable and the results are similar in form, we do not know of any direct connection between the models studied in this paper and any interacting particle system in the KPZ class. Our models are random walks in a dynamical random environment that is static away from the vicinity of the walker. This is a different situation than, say, the motion of the second-class particle in ASEP, which is a random walk in an environment that is dynamic everywhere but is not affected by the walker.

Ideally we would also like to prove bounds for the original version of the models where \(\varepsilon = 0.\) The obstruction there is the lack of ellipticity that allows us to study the process under the much simpler dynamics of *U* in Lemmas 4.1 and 5.5.

#### 1.1.1 Paper Overview

In Sect. 2 we use simple stand-alone arguments to prove Theorem 1.6. In Sect. 3 we introduce the resolvent method, which we use in Sect. 4 to produce the upper lower bounds on the mean-square displacement. In Sect. 5 we use the resolvent method to produce lower bounds that are valid for \(d=1\) and the totally anisotropic case in \(d=2.\) Finally, in Sect. 6 we gather all these results together to present proofs of Theorems 1.7, 1.10 and 1.11 .

## 2 One-Dimension; Proof of Theorem 1.6

In this section we prove Theorem 1.6, first by showing the M1 model is ballistic through a simple case-by-case argument and second by showing that the M2 model is equivalent to the TSAW [14].

### Proof for the M1 model

*n*steps (i.e. \(Y_n = X_{T_n},\) where \(T_n\) is the

*n*th jump time). The key is to notice that if ever the hand and current site arrows point in the same direction, then this situation is restored after at most three steps, during which time the walker moves one unit in that original direction. To see this, there are two cases to consider. First, if the arrow at the next site also agrees with the hand and site arrow then we have the sequence

### Proof for the M2 model

We begin by constructing a function \(\ell _0\) on the edges of the one-dimensional lattice whose negative gradient is equal to the configuration of the arrows. We will show that this function evolves in the same way as the local time profile of the one-dimensional TSAW with nearest-neighbour interaction. To do so, let \(\gamma _t\) denote the environment of arrows with respect to a fixed origin (i.e. not with respect to the position of the walker). Also define \(\gamma _t(X_t),\) where \(X_t\) is the position of the walker, to equal the sum of the hand and site arrows at that location. Therefore \(\gamma _t(x) \in \{-1,+1\}\) if \(x \ne X_t\) and \(\gamma _t(X_t) \in \{-2,0,+2\}\) (see Fig. 3).

*X*evolves according to the rule

## 3 The Resolvent Method

The key to the proof of Theorems 1.7, 1.10 and 1.11 is to express \({\widehat{E}}(\lambda )\) in terms of a variational formula for the resolvent of \(G_\varepsilon \) and \({\widetilde{G}}_\varepsilon .\) Throughout, we will be working on the space \(L^2(\varOmega , \pi ),\) for which we will denote the inner product by \((\cdot , \cdot )_\pi ,\) with \(\pi \) any of the product measures from (1.1).

*V*.

*U*is self-adjoint, so

### Lemma 3.1

*V*and \(f : \varOmega \rightarrow \mathbb {R},\) define

*V*. Then we have

### Proof

*t*. With this in place the covariance becomes

An immediate corollary of Lemma 3.1 is that in all dimensions \(E(t) \ge t.\) In particular, this proves the lower bound in Theorem 1.10.

*symmetric part*of the generators

*anti-symmetric part*

## 4 The Upper Bound

In this section we derive upper bounds on \({\widehat{\varLambda }}(\lambda , \phi _i)\) and \({\widehat{\varLambda }}(\lambda , {\widetilde{\phi }}_i)\) that are valid for all \(d \ge 1.\) Unless stated otherwise, all results in this section apply to both \(G_\varepsilon \) and \({\widetilde{G}}_\varepsilon .\) Since the results in this section do not depend on the choice of \(i \in \{1,2,\ldots ,d\},\) we will drop the index and write \(\phi (\omega )\) and \({\widetilde{\phi }}(\omega )\) in place of \(\phi (\omega )_i\) and \({\widetilde{\phi }}(\omega )_i.\)

*U*, which do not depend on the state of the environment of arrows. The following coupling argument allows us to express \(\varPhi _U(t; \phi )\) as the return probability of SRW with a sticky origin. This enables an exact calculation of \({\widehat{\varPhi }}_U(\lambda ; \phi ).\)

### Lemma 4.1

*W*be a continuous-time rate 1 SRW on \(\mathbb {Z}^d\) with a sticky origin. That is, when \(W=0,\) at the next jump time it remains there with probability \(\tfrac{1}{2},\) otherwise it takes a SRW step. Then

### Proof

We will only present the proof for \(\phi ,\) since the proof for \({\widetilde{\phi }}\) is almost identical.

*U*. Define \(\eta ^-_0 = \omega ^-\) and have \(\eta ^-\) follow exactly the same sequence of swaps and shifts as \(\eta ^+.\) Trivially \(\eta ^-\) also follows the dynamics of

*U*. Then we can write

*U*are not affected by the environment, at all times \(\eta ^+\) and \(\eta ^-\) disagree only at a single site, which we will call the defect. Furthermore \(\eta ^+\) and \(\eta ^-\) maintain an equal displacement from the defect for all times.

Now let \(W_t\) denote the displacement of the walker from the defect at time *t*. When the walker is away from defect, \(W_t\) evolves as rate 1 SRW. When \(W_t = 0,\) however, the walker has the defect in its hand with probability \(\tfrac{1}{2}\) (this probability persists due to the initial swap). If the defect is either in the walker’s hand or at the site of the walker, then under the dynamics of *U* the defect moves with the walker with probability \(\tfrac{1}{2}.\) Therefore \(W_t\) remains at 0 with probability \(\tfrac{1}{2}\) so is indeed a SRW with sticky origin.

The proof is now complete by (4.3) and noting that \(\phi (\eta ^+_t) - \phi (\eta ^-_t)= 2 \cdot \mathbf {1}_{W_t = 0}.\)\(\square \)

*u*is a function of two variables we will write

### Lemma 4.2

### Proof

*k*denote the transition kernel of the SRW with sticky origin

*W*

*x*-variable gives

The remainder of the result follows by an elementary calculation, Lemma 3.1 and inequality (4.2). \(\square \)

## 5 Lower Bound for \(d=1\) and Totally Anisotropic \(d=2\)

Since we will eventually be using the work in this section to prove the lower bounds in Theorems 1.7 and 1.11, it will suffice to take the initial measure, \(\pi _p,\) to be such that \(p_1 = 1.\) In \(d=1\) this is the only drift-free measure, and in \(d=2\) this is no loss of generality in the totally anisotropic case, by symmetry. Throughout the following we only consider \(d = 1\) or 2.

### Remark 5.1

(The \(d=2\) cases) In two-dimensions, the totally anisotropic case is substantially easier to analyse than the non-totally anisotropic case, which is the subject of the next section. This is reflected in the relative strength of the orders of the bounds in Theorem 1.11. The key observation is that for the totally anisotropic initial condition it suffices to prove weak bounds on the main correlation function (Definition 5.4 and Lemma 5.5) in this section. Indeed the relevant bound (Lemma 5.6) follows from a simple application of Cauchy–Schwarz. This method fails when we have an initial condition that is not totally anisotropic.

*u*so that

*u*be an even function to make the Fourier transform \(\mathscr {F}u\) real-valued. Throughout let \(\Vert \cdot \Vert _2\) denote the norm on \(\ell ^2(\mathbb {Z}^d_\star ; \mathbb {R})\) and define the gradients \(\nabla ^+\) and \(\nabla ^-\) by

### Lemma 5.2

- (i)
\(\langle \phi , \psi \rangle _\pi = u(0) = \langle {\widetilde{\phi }}, \psi \rangle _\pi ,\)

- (ii)
\(\langle \psi , \psi \rangle _\pi = \Vert u \Vert _{2}^2,\)

- (iii)
\(\langle \psi , S_\varepsilon \psi \rangle _\pi = - \tfrac{1+\varepsilon }{2} \Vert \nabla _1^+ u \Vert _2^2 - \tfrac{\varepsilon }{2} \Vert \nabla _2^+ u \Vert _2^2= \langle \psi , {\widetilde{S}}_\varepsilon \psi \rangle _\pi ,\)

- (iv)
\(A\psi (\omega ) = -\tfrac{1}{4} \sum _{x \in \mathbb {Z}^d} \nabla _1 u(x) \{ \omega (0)_1 + \omega (\star )_1 \} \omega (x)_1 = {\widetilde{A}} \psi (\omega ).\)

### Proof

(i), (ii) Trivial given the product form of \(\pi ,\) and that \(u(\star ) = u(0).\)

*U*gives

*u*is symmetric

### Lemma 5.3

### Proof

*C*is the order-four correlation function

*C*as the transition kernel of a defect process. This time, however, the underlying random walk is 2

*d*-dimensional and more complicated.

### Definition 5.4

*Defect walk*) Define a graph \(\mathscr {G} = ({\mathsf {V}}, {\mathsf {E}})\) with vertex set

*D*to be a rate 1 nearest neighbour symmetric random walk on \(\mathscr {G}\) and denote its transition kernel by

### Lemma 5.5

*K*is the transition kernel from Definition 5.4.

### Proof

*U*. Now any pair of these processes have two defects, so let \(D^1_t\) denote the displacement of the defect that is initially at

*x*and \(D^2_t\) the displacement of the defect initially at 0. Then \(D_t := (D^1_t, D^2_t)\) has the dynamics described in Definition 5.4.

*D*, we have

Evaluating the Laplace transform of the kernel in Definition 5.4 could be tricky. Fortunately a simple application of Cauchy–Schwarz allows us to obtain a bound on (5.5) in terms of the transition of a *d*-dimensional SRW with sticky origin. The key observation is that if we project the walk *D* from Definition 5.4 down to one of its coordinates, then the corresponding process is a SRW with sticky origin. This is easiest to see from Fig. 5.

### Lemma 5.6

### Proof

*x*and

*y*variables and the positivity of

*C*from Lemma 5.5. Writing \(k_t\) for the transition kernel of a one-dimensional random walk with sticky origin (as in Lemmas 4.1 and 4.2), by the remark made above we have

The final step in this section is to combine Lemmas 5.3 and 5.6 and to choose *u* appropriately to get a non-trivial lower bound. This is done through a simple point-wise optimisation of a quadratic integrand. Additional work must be done to ensure that the choice of *u* satisfies the constraints in (5.2).

### Lemma 5.7

### Proof

*v*is such that \(\mathscr {F}v(p) = H_\lambda (p)^{-1}.\) Since \(H_\lambda \) is even and bounded, there is guaranteed to exist such a

*v*that is real-valued and even, whereby the integrand takes value \(H_\lambda (p)^{-1}.\)

*v*, however, does not satisfy (5.2), and so we define

*u*satisfies (5.2) and \(\mathscr {F} u (p) = \mathscr {F} v (p) + \theta ,\) so setting into the integral gives

*O*notation for the limit \(\lambda \rightarrow 0.\) That is, there are positive constants

*c*,

*C*, (which may depending on \(\epsilon \) but do not depend on

*p*), such that \(c I_\lambda p_1^2 \le H_\lambda (p) \le C I_\lambda \) for all sufficiently small \(\lambda >0.\) Hence

## 6 Completing the Proof of Theorems 1.7, 1.10 and 1.11

In this section we use the results derived so far to complete the proofs of the main theorems. We use the \(\varOmega \) notation for asymptotic lower bounds as \(\lambda \rightarrow 0,\) up to a positive multiplicative constant which may depend on \(\varepsilon .\)

### 6.1 Upper Bounds in all Cases

All upper bounds follow from Lemma 4.2. \(\square \)

### 6.2 Lower Bound \(d \ge 3\)

The lower bound in the time domain for Theorem 1.10 follows immediately from Lemma 3.1 and implies the Laplace lower bound. \(\square \)

### 6.3 Lower Bound \(d = 1\)

### 6.4 Lower Bound \(d = 2,\) Totally Anisotropic

### 6.5 Obstruction for the Two-Dimensional Non-totally Anisotropic Case

It seems necessary to follow the computations in [15] and to choose a linear functional \(\psi \) in Sect. 5 that depends on both components \(\{ \omega (x)_1 \}_{x \in \mathbb {Z}^d_\star }\) and \(\{ \omega (x)_2 \}_{x \in \mathbb {Z}^d_\star }\) and to avoid the crude Cauchy–Schwarz estimates in Lemma 5.6. The difficulty here is that this necessitates a more detailed analysis of the transition kernel from Definition 5.4, which is currently out of our reach.

The authors wish to thank the referees for their helpful comments.

## Notes

### Acknowledgements

Supported by EPSRC (UK) Established Career Fellowship EP/P003656/1 and by NKFI (HU) K-129170.

## References

- 1.Alder, B.J., Wainwright, T.E.: Velocity autocorrelation for hard spheres. Phys. Rev. Lett.
**18**, 988–990 (1967)ADSCrossRefGoogle Scholar - 2.Alder, B.J., Wainwright, T.E.: Decay of the velocity autocorrelation function. Phys. Rev. A
**1**, 18–21 (1970)ADSCrossRefGoogle Scholar - 3.Amit, D., Parisi, G., Peliti, L.: Asymptotic behaviour of the ‘true’ self-avoiding walk. Phys. Rev. B
**27**, 1635–1645 (1983)ADSMathSciNetCrossRefGoogle Scholar - 4.Dobrushin, R.L., Sukhov, Y.M., Fritts, Ĭ.: A.N. Kolmogorov—founder of the theory of reversible Markov processes. Uspekhi Mat. Nauk
**43**, 167–188 (1988)MathSciNetGoogle Scholar - 5.Forster, D., Nelson, D., Stephen, M.: Large distance and long time properties of a randomised fluid. Phys. Rev. A
**16**, 732–749 (1970)ADSCrossRefGoogle Scholar - 6.Horváth, I., Tóth, B., Vető, B.: Diffusive limits for “true” (or myopic) self-avoiding random walks and self-repellent Brownian polymers in three and more dimensions. Probab. Theory Relat. Field
**153**, 691–726 (2012)CrossRefGoogle Scholar - 7.Komorowski, T., Landim, C., Olla, S.: Fluctuations in Markov Processes: Time Symmetry and Martingale Approximation. Grundlehren der mathematischen Wissenschaften, vol 345. Springer, Berlin (2012)CrossRefGoogle Scholar
- 8.Landim, C., Quastel, J., Salmhoffer, M., Yau, H.T.: Superdiffusivity of asymmetric exclusion process in dimensions one and two. Commun. Math. Phys.
**244**, 455–481 (2004)ADSMathSciNetCrossRefGoogle Scholar - 9.Landim, C., Ramirez, A., Yau, H.T.: Superdiffusivity of two dimensional lattice gas models. J. Stat. Phys.
**119**, 963–995 (2005)ADSMathSciNetCrossRefGoogle Scholar - 10.Quastel, J., Valkó, B.: A note on the diffusivity of finite-range asymmetric-exclusion processes on \(\mathbb{Z}\). In: Sidoravicius, V., Vares, M.E (eds.) In and Out of Equilibrium. 2 Progress in Probability, vol. 60, pp. 543–549. Birkhäuser, Basel, MR2477369 (2008)Google Scholar
- 11.Quastel, J., Valkó, B.: Diffusivity of lattice gases. Arch. Ration. Mech. Anal.
**210**, 269–320 (2013)MathSciNetCrossRefGoogle Scholar - 12.Sethuraman, S.: Central limit theorems for additive functionals of the simple exclusion process
*Annals of Probability*, 28:277–302, 2000. Ann. Probab.**34**, 427–428 (2006)MathSciNetCrossRefGoogle Scholar - 13.Tarrès, P., Tóth, B., Valkó, B.: Diffusivity bounds for 1d Brownian polymers. Ann. Probab.
**40**, 695–713 (2012)MathSciNetCrossRefGoogle Scholar - 14.Tóth, B.: ‘True’ self-avoiding walk with bond repulsion on \(\mathbb{Z}\): limit theorems. Ann. Probab.
**23**, 1523–1556 (1995)MathSciNetCrossRefGoogle Scholar - 15.Tóth, B., Valkó, B.: Superdiffusive bounds on self-repellent Brownian polymers and diffusion in the curl of the Gaussian free field in \(d=2\). J. Stat. Phys.
**147**, 113–131 (2012)ADSMathSciNetCrossRefGoogle Scholar - 16.Tóth, B., Werner, W.: The true self-repelling motion. Probab. Theory Relat. Fields
**111**, 375–452 (1998)MathSciNetCrossRefGoogle Scholar - 17.Yaglom, A.M.: On the statistical reversibility of Brownian motion. Mat. Sbornik. N.S.
**24**, 457–492 (1949)MathSciNetGoogle Scholar

## Copyright information

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.