Abstract
We consider an irreducible finite range random walk on the d-dimensional integer lattice and study asymptotic behavior of its transition function p(n; x) close to the boundary of Cramér’s zone.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
In 1921, with the article [11] Pólya pioneered research on the simple random walk on the integer lattice. Using Fourier analysis he proved that p(n; x), the n’th step transition function, satisfiesFootnote 1
for any \(x \in \mathbb {Z}^d\). Essentially, Pólya’s proof shows that (see Spitzer [13, Remark after P7.9])
uniformly with respect to \(n \in \mathbb {N}\) and \(x \in \mathbb {Z}^d\). As it may be easily seen, the local limit theorem is very inaccurate when \({\left|x \right|}_2\) is larger than \(\sqrt{n}\). Further development of the Fourier method allowed to gain better control over the error term for large \({\left|x \right|}_2\) (see Smith [12], Spitzer [13, P7.10], Ney and Spitzer [10, Theorem 2.1]). Namely,
uniformly with respect to \(x \in \mathbb {Z}^d {\setminus } \{0\}\). Let us observe that the error in the approximation of p(n; x) is additive and may become large compared to the first term. In many applications, it is desired to have an asymptotic formula for p(n; x) valid on the largest possible region with respect to n and x. There are some results in this direction available. In particular, (see Lawler [8, Propositon 1.2.5], Lawler and Limic [9, Theorem 2.3.11]) showed that there is \(\rho > 0\) such that for all \(n \in \mathbb {N}\) and \(x \in \mathbb {Z}^d\), if \({\left|x \right|}_2 \le \rho n\) then
Let us emphasize that the above asymptotic formula is valid for random walks having exponential moment. However, applied to the simple random walk gives the asymptotic formula useful only in the region where \({\left|x \right|}_2 = o(n^{3/4})\). Therefore, there arises a natural question:
Is there an asymptotic formula forp(n; x) which is valid on a larger region than\({\left|x \right|}_2 = o(n^{3/4})\)?
The purpose of this article is to give a positive answer to the possed question. To be more precise, let us first introduce some notation. Let p be the transition function of the irreducible finite range random walk. By \(\mathcal {V}\) we denote its support, namely
Let \(\mathcal {M}\) be the interior of the convex hull of \(\mathcal {V}\). For \(\delta \in \mathcal {M}\) we set
where \(\kappa \) is a function on \(\mathbb {R}^d\) defined by the formula
We also need a quadratic form on \(\mathbb {R}^d\) given by \(B_x(u, u) = D_u^2 \log \kappa (x)\). In Sect. 3 we prove the following theorem.
Theorem A
Let p be a transition function of an irreducible finite range random walk on \(\mathbb {Z}^d\). Let r be its period and \(X_0, \ldots , X_{r-1}\) the partition of \(\mathbb {Z}^d\) into aperiodic classes. There is \(\eta \ge 1\) such that for each \(j \in \{0, \ldots , r-1\}\), \(n \in \mathbb {N}\) and \(x \in X_j\), if \(n \equiv j \pmod r\) then
otherwise \(p(n; x) = 0\), where \(\delta = \frac{x}{n}\) and \(s = \nabla \phi (\delta )\).
Some comments are in order. First, observe that the asymptotic formula (2) is valid in a region excluding only the case when \(n {\text {dist}}(\delta , \mathcal {M})^{2\eta }\) stays bounded. Although the function \(\phi \) is positive convex and comparable to \({\left|\, \cdot \, \right|}_2^2\), see Claim 1, it cannot be replaced in the asymptotic formula by \({\left|\, \cdot \, \right|}_2^2\) without introducing an additional error term, see Remark 1. For processes with continuous time it was observed by Davis in [3] that in order to get an upper bound for the heat kernel on a larger region one has to introduce a non-Gaussian factor. Therefore, Theorem A may be considered as a discrete time counterpart of [3]. Finally, although the quadratic form \(B_x\) is explicitly given, the mapping \(\mathcal {M}\ni \delta \mapsto s(\delta )\) is an implicit function. We want to stress the fact that while \(\delta \) approaches the boundary of \(\mathcal {M}\), the value of \({\left|s \right|}_2\) tends to infinity. In particular, the quadratic form \(B_s\)degenerates. For this reason a more convenient form of Theorem A is given in Corollary 3.2.
A positive answer to the posed question is partially given in [2, Theorem 4.1], however thanks to Theorem A we get the control over the error term.
Let us comment about the method of the proof of Theorem A. First, with the help of the Fourier inversion formula, we write p(n; x) as an oscillatory integral. We split the integral into two parts. The first part we analyze by the Laplace method. This is not a straightforward application of it, since the phase function degenerates as \(\delta \) approaches the boundary of \(\mathcal {M}\). To estimate the second part we develop a geometric argument (see Theorem 2.2), which allows us to control the way how the quadratic form \(B_s\) degenerates. In fact, Theorem 2.2, is the main observation of the present paper. It can be successfully applied in much wider context. For example, to study finitely supported isotropic random walks on affine buildings (see [14]). The result obtained in this article has already found an application in the study of subordinated random walks (see [1]) which are spread all over \(\mathbb {Z}^d\) and do not have second moment. There is also an ongoing project to get the precise asymptotic formula for random walks with internal degrees of freedom extending the one obtained by Krámli and Szász [7] (see also Guivarc’h [4]). Finally, Appendix A contains applications of Theorem 3.1 to triangular and hexagonal lattices. This has to be compared with results recently obtained in [5, 6].
1.1 Notation
We use the convention that C stands for a generic positive constant whose value can change from line to line. The set of positive integers is denoted by \(\mathbb {N}\). Let \(\mathbb {N}_0 = \mathbb {N}\cup \{0\}\).
2 Preliminaries
2.1 Random walks
Let \(p(\cdot , \cdot )\) denote the transition density of a random walk on the d-dimensional integer lattice. Let \(p(x) = p(0, x)\). For \(n \in \mathbb {N}_0\) and \(x \in \mathbb {Z}^d\) we set
The support of p is denoted by \(\mathcal {V}\), i.e.
We assume that the set \(\mathcal {V}\) is finite. Let \(\kappa : \mathbb {C}^d \rightarrow \mathbb {C}\) be an exponential polynomial defined by
where \({\langle \,\cdot \,, \,\cdot \,\rangle }\) is the standard scalar product on \(\mathbb {C}^d\), i.e.,
In particular, \(\mathbb {R}^d \ni \theta \mapsto \kappa (i\theta )\) is the characteristic function of p. We set
Finally, the interior of the convex hull of \(\mathcal {V}\) in \(\mathbb {R}^d\) is denoted by \(\mathcal {M}\).
In this article, we study the asymptotic behavior of transition functions of irreducible finite range random walks. Let us recall that the random walk is irreducible if for each \(x \in \mathbb {Z}^d\) there is \(n \in \mathbb {N}\) such that \(p(n; x) > 0\). By \(r \in \mathbb {N}\) we denote the period of p, that is
Then the space \(\mathbb {Z}^d\) decomposes into r disjoint classes
for \(j = 0, \ldots , r-1\). We observe that for \(j \in \{0, \ldots , r-1\}\) and \(x \in X_j\), if \(n \not \equiv j \pmod r\) then
For each \(x \in \mathbb {Z}^d\), by \(m_x\) we denote the smallest \(m \in \mathbb {N}\) such that \(p(m; x) > 0\), thus \(x / m_x \in \overline{\mathcal {M}}\). Notice that there is \(C \ge 1\) such that for all \(x \in \mathbb {Z}^d\),
Indeed, let \(\{e_1, \ldots , e_d\}\) be the standard basis of \(\mathbb {R}^d\). Since
for some \(m_{j, v}, m_{-j, v} \in \mathbb {N}_0\) satisfying
by setting \(\varepsilon _j = {\text {sign}}{\langle x, e_j\rangle }\) we get
Hence,
which, together with boundedness of \(\overline{\mathcal {M}}\), implies (4).
Next, we observe that there is \(K > 0\) such that for all \(k \ge K\),
thus for all \(x \in \mathbb {Z}^d\) and \(n \ge Kr + m_x\),
Since
do not lay on the same affine hyperplane, the interior of the convex hull of (6) is a non-empty subset of \(\mathcal {M}\).
For each \(x \in \mathbb {R}^d\), by \(B_x\) we denote a quadratic form on \(\mathbb {R}^d\) defined by
where \(D_u\) denotes the derivative along a vector u, i.e.
Since
and
we may write
In particular, if the random walk is irreducible then the quadratic form \(B_x\) is positive definite.
Example 1
Let p be the transition function of the simple random walk on \(\mathbb {Z}^d\), i.e.
Thus
Since
we get \(\mathcal {U}= \{0, (-\pi , -\pi , \ldots , -\pi )\}\). By a straightforward computation we may find the quadratic form \(B_0\),
2.2 Function s
For the sake of completeness we provide the proof of the following well-known theorem.
Theorem 2.1
For every \(\delta \in \mathcal {M}\) a function \(f(\delta ,\,\cdot \,): \mathbb {R}^d \rightarrow \mathbb {R}\) defined by
attains its maximum at the unique point \(s \in \mathbb {R}^d\) satisfying \(\nabla \log \kappa (s) = \delta \).
Proof
Without loss of generality, we may assume \(\nabla \kappa (0)=0\). Indeed, otherwise we will consider
where \(v_0 = \nabla \kappa (0)\) and \(\tilde{\mathcal {V}} = \mathcal {V}- v_0\). Then \(\tilde{\mathcal {M}}\), the interior of the convex hull of \(\tilde{\mathcal {V}}\), is equal to \(\mathcal {M}- v_0\). For \(\tilde{\delta } = \delta - v_0\) we have
We conclude that if s is the unique maximum of \(\mathbb {R}^d \ni x \mapsto \tilde{f}(\tilde{\delta }, x)\), then it is also the unique maximum of \(\mathbb {R}^d \ni x \mapsto f(\delta , x)\). Because
we get \(\nabla \log \kappa (s) = \tilde{\delta } + v_0 = \delta \), proving the claim.
Fix \(\delta \in \mathcal {M}\). Since \(\nabla \kappa (0) = 0\), by Taylor’s theorem we have
as \({\left|x \right|}_2\) approaches zero. Moreover, for any \(x, u \in \mathbb {R}^d\),
thus the function \(\mathbb {R}^d \ni x \mapsto f(\delta , x)\) is strictly concave.
Let us observe that
Since \(\mathcal {M}\) is not empty, the set \(\mathcal {V}\) cannot be contained in an affine hyperplane, thus \(0 \in \mathcal {M}\).
Now, \(\delta \in \mathcal {M}\) implies that there are \(v_1, \ldots , v_d \in \partial \mathcal {M}\cap \mathcal {V}\) such that \(\delta \) belongs to the convex hull of \(\{0, v_1, \ldots , v_d\}\), i.e. there are \(t_0, t_1, \ldots t_d \in [0, 1]\) satisfying
Because \(\delta \not \in \partial \mathcal {M}\) we must have \(t_0 > 0\), thus \(\sum _{j = 1}^d t_j < 1\). Hence,
and we get
which implies that
because
and the proof is finished. \(\square \)
In the rest of the article, given \(\delta \in \mathcal {M}\) by s we denote the unique solution to
Let \(\phi : \mathcal {M} \rightarrow \mathbb {R}\) be defined by
thus, by Theorem 2.1,
By (9), for any \(u \in \mathbb {R}^d\),
Hence, for \(u, u' \in \mathbb {R}^d\),
i.e. \(D_u s = B_s^{-1} u\). Therefore, we can compute
thus
In particular, \(\phi \) is a convex function on \(\mathcal {M}\). Let \(\delta _0 = \nabla \log \kappa (0)\). By Taylor’s theorem, we have
as \(\delta \) approaches \(\delta _0\). We claim that
Claim 1
For all \(\delta \in \mathcal {M}\),Footnote 2
Since \(\phi \) is convex and satisfies (12), it is enough to show that \(\phi \) is bounded from above. Given \(\delta \in \mathcal {M}\), let \(v_0 \in \mathcal {V}\) be any vector satisfying
Because
we get
proving the claim.
Example 2
Let p be the transition density of the simple random walk on \(\mathbb {Z}\). Then \(\mathcal {V}= \{-1, 1\}\), \(\mathcal {U}= \{0, -\pi \}\) and \(\mathcal {M}= (-1, 1)\). For \(\delta \in \mathcal {M}\), we have
and
Hence, using (11) we obtain
In general, there is no explicit formula for the function \(\phi \). By the implicit function theorem, the function s is real analytic on \(\mathcal {M}\). In particular, s is bounded on any compact subset of \(\mathcal {M}\). On the other hand, \({\left|s \right|}_2\) approaches infinity when \(\delta \) tends to \(\partial \mathcal {M}\). To see this, let us denote by \(\mathcal {F}\) a facet of \(\mathcal {M}\) such that \(\delta \) approaches \(\partial \mathcal {M}\cap \mathcal {F}\). Let u be an outward unit normal vector to \(\mathcal {M}\) at \(\mathcal {F}\). Then for each \(v_1 \in \mathcal {F}\cap \mathcal {V}\) and \(v_2 \in \mathcal {V}{\setminus } \mathcal {F}\) we have
Therefore, for any \(v \in \mathcal {V}{\setminus } \mathcal {F}\),
The next theorem provides a control over the speed of convergence in (13).
Theorem 2.2
There are constants \(\eta \ge 1\) and \(C > 0\) such that for all \(\delta \in \mathcal {M}\), and \(v \in \mathcal {V}\) we have
where \(s=s(\delta )\) satisfies \(\delta = \nabla \log \kappa (s)\).
Proof
We consider any enumeration of elements of \(\mathcal {V}= \{v_1, \ldots , v_N\}\). Define
where \(\mathcal {S}\) is the unit sphere in \(\mathbb {R}^d\) centered at the origin. Since \(\mathcal {V}\) is finite, it is enough to prove that there are \(C > 0\) and \(\eta \ge 1\) such that for all \(x \in \mathbb {R}^d\), if \(\frac{x}{{\left|x \right|}_2} \in \Omega \) then for all \(v \in \mathcal {V}\),
where
Without loss of generality, we may assume that \(\Omega \ne \emptyset \). Let k be the smallest index such that points \(\{v_1, \ldots , v_k\}\) do not lay on the same facet of \(\mathcal {M}\). Let us recall that a set \(\mathcal {F}\) is a facet of \(\mathcal {M}\) if there are \(\lambda \in \mathcal {S}\) and \(c \in \mathbb {R}\) such that for all \(v \in \mathcal {V}\), \({\langle \lambda , v\rangle } \le c\), and
Since \(\{v_1, \ldots , v_k\}\) do not lay on the same facet of \(\mathcal {M}\) and \(\Omega \) is a compact set, there is \(\epsilon > 0\) such that for all \(\omega \in \Omega \) we have
Indeed, otherwise, there are \(\omega _n \in \Omega \) such that
Since \(\Omega \) is compact, there is \(\omega _0 \in \Omega \) such that
and for each \(i \in \{2, \ldots , N\}\),
This contradicts that \(\{v_1, \ldots , v_k\}\) do not lay on the same facet of \(\mathcal {M}\).
Let \(\mathcal {F}\) be a facet containing \(\{v_1,\ldots ,v_{k-1}\}\) determined by \(\lambda \in \mathcal {S}\) and \(c \in \mathbb {R}\). Let us consider \(x \in \mathbb {R}^d\) such that \(\frac{x}{{\left|x \right|}_2} \in \Omega \) and
The distance of \(\delta \) to a plane containing the facet \(\mathcal {F}\) is not bigger than \(c - {\langle \lambda , \delta \rangle }\), thus
Since
we obtain
In particular, for \(1 \le j \le k\), we have
If \(j > k\), we can estimate
which finishes the proof since, by (14),
thus it is enough to take
\(\square \)
Example 3
For \(k \in \mathbb {N}\), let us consider a transition probability,
Then for \(\delta \in (-k, 2)\) we have
Hence,
and
2.3 Analytic lemmas
For a multi-index \(\sigma \in \mathbb {N}^d\) we denote by \(X_\sigma \) a multi-set containing \(\sigma (i)\) copies of i. Let \(\Pi _\sigma \) be a set of all partitions of \(X_\sigma \). For the convenience of the reader we recall the following lemma.
Lemma 2.3
(Faà di Bruno’s formula) There are positive constants \(c_\pi \), \(\pi \in \Pi _\sigma \), such that for sufficiently smooth functions \(f: S \rightarrow T\), \(F: T \rightarrow \mathbb {R}\), \(T \subset \mathbb {R}\), \(S \subset \mathbb {R}^d\), we have
where \(\pi = \{B_1, \ldots , B_m\}\).
Let us observe that for
the function F(f(s)) is real-analytic in some neighborhood of \(s = 0\), thus there is \(C > 0\) such that for every \(\sigma \in \mathbb {N}^d\),
Therefore,
where for a multi-set B containing \(\sigma (i)\) copies of i we set
Using Lemma 2.3 one can show
Lemma 2.4
Let \(\mathcal {V}\subset \mathbb {R}^d\) be a set of finite cardinality. Assume that for each \(v \in \mathcal {V}\), we are given \(a_v \in \mathbb {C}\), and \(b_v > 0\). Then for \(z = x+i\theta \in \mathbb {C}^d\) such that
we have
Moreover, there is \(C > 0\) such that for all \(\sigma \in \mathbb {N}^d\),
Proof
We start by proving (16). We have
because \({|{{\langle \theta , v-v'\rangle }} |} \le 1\).
For the proof of (17), it is enough to show
Indeed, since
by (18) and the Leibniz’s rule we obtain (17). To show (18), we use Faà di Bruno’s formula with \(F(t) = 1/t\). By Lemma 2.3 together with estimates (16) and (19) we get
where in the last inequality we have used (15). \(\square \)
3 Heat kernels
In this section we show the asymptotic behavior of the n’th step transition density of an irreducible finite range random walk on the integer lattice \(\mathbb {Z}^d\). Before we state and prove the main theorem, let us present the following example.
Example 4
Let p be the transition function of the simple random walk on \(\mathbb {Z}\). If \(x \equiv n \pmod 2\) then
Let us recall Stirling’s formula
Hence, we have
where \(\delta = \frac{x}{n}\) and \(\phi (\delta ) = \frac{1}{2} (1-\delta ) \log (1-\delta ) + \frac{1}{2} (1+\delta ) \log (1+\delta )\).
Theorem 3.1
Let p be an irreducible finite range random walk on \(\mathbb {Z}^d\). Let r be its period and \(X_0, \ldots , X_{r-1}\) the partition of \(\mathbb {Z}^d\) into aperiodic classes. There is \(\eta \ge 1\) such that for each \(j \in \{0, 1, \ldots , r-1\}\), \(n \in \mathbb {N}\) and \(x \in X_j\), if \(n \equiv j \pmod r\) then
otherwise \(p(n; x) = 0\), where \(\delta = \frac{x}{n}\), \(s = \nabla \phi (\delta )\) and
Proof
Using the Fourier inversion formula we can write
where \(\mathscr {D}_d = [-\pi , \pi )^d\). If \(\theta _0 \in \mathcal {U}\) then \(\kappa (i \theta _0) = e^{it}\) for some \(t \in [-\pi , \pi )\) where \(\mathcal {U}\) is defined in (3). Since \(\kappa (i\theta _0)\) is a convex combination of complex numbers from the unit circle, \(\kappa (i \theta _0) = e^{i t}\) if and only if \(e^{i {\langle \theta _0, v\rangle }} = e^{it}\) for each \(v \in \mathcal {V}\). In particular,
thus, whenever \(p(n; x) > 0\), we must have
Hence, by (5),
which implies that \(e^{i t}\) is r’th root of unity. In particular, the set \(\mathcal {U}\) has the cardinality r. Next, we claim that
Claim 2
For any \(u \in \mathbb {R}^d\),
To see this, we observe that if \(y \in \mathbb {R}^d\) and \(x \ne y\), then we have
otherwise
Therefore,
We notice that if \(p(n; x) > 0\) then \(\delta = \frac{x}{n} \in \overline{\mathcal {M}}\). Since \({\text {dist}}(\delta , \partial \mathcal {M}) > 0\), by Theorem 2.1, there is the unique \(s=s(\delta )\) such that \(\nabla \log \kappa (s) = \delta \). Hence, by Claim 2, we can write
because
Let \(\epsilon > 0\) be small enough to satisfy (25), (27) and (30). We set
Then the integral over \(\mathscr {D}_d^\epsilon \) is negligible. To see this, we write
Now, we need the following estimate.
Claim 3
For every \(v_0 \in \mathcal {V}\), there is \(\xi > 0\) such that for all \(\theta \in \mathscr {D}_d^\epsilon \) there is \(v \in \mathcal {V}\) satisfying
For the proof, we assume to contrary that for some \(v_0 \in \mathcal {V}\) and all \(m \in \mathbb {N}\) there is \(\theta _m \in \mathscr {D}_d^\epsilon \) such that for all \(v \in \mathcal {V}\),
By compactness of \(\mathscr {D}_d^\epsilon \), there is a subsequence \((\theta _{m_k} : k \in \mathbb {N})\) convergent to \(\theta ' \in \mathscr {D}_d^\epsilon \). Then for all \(v \in \mathcal {V}\),
and hence
which is impossible since \(\theta ' \in \mathscr {D}_d^\epsilon \).
In order to apply Claim 3, we select any \(v_0\) satisfying
thus \(e^{{\langle s, v_0\rangle }} \ge \kappa (s)\). By Claim 3 and (22), for each \(\theta \in \mathscr {D}_d^\epsilon \) there is \(v \in \mathcal {V}\) such that
Although v may depend on \(\theta \), by Theorem 2.2, there are \(C > 0\) and \(\eta \ge 1\) such that for all \(\theta \in \mathscr {D}_d^\epsilon \),
Hence,
Since
we obtain that
provided n is large enough. We observe that for any \(u \in \mathbb {R}^d\),
thus for any \(u, u' \in \mathbb {R}^d\),
and hence
Therefore, we conclude that
Next, let us consider the integral over
By taking \(\epsilon \) satisfying
we guarantee that the sets in (24) are disjoint. Moreover, for any \(\theta _0 \in \mathcal {U}\), by the change of variables and (21) we get
Therefore,
Further, by (16), a function \(z \mapsto {\text {Log}}\kappa (z)\), where \({\text {Log}}\) denotes the principal value of the complex logarithm, is an analytic function in a strip \(\mathbb {R}^d + i B\) where
Since for any \(u \in \mathbb {R}^d\) we have
by Lemma 2.4, there is \(C > 0\) such that for all \(\sigma \in \mathbb {N}^d\) and \(a + i b \in \mathbb {R}^d + i B\),
If
then for \({\left|\theta \right|}_2 < \epsilon \) we can define
Hence,
and to finish the proof of theorem it is enough to show
Claim 4
Using the integral form for the reminder, we get
In view of (26), there is \(c > 0\) such that for all \(s \in \mathbb {R}^d\) and \(\theta \in B\),
Therefore, by choosing
if \({\left|\theta \right|}_2 < \epsilon \) then we may estimate
Next, we write
and we split (28) into four corresponding integrals.
Since for \(a \in \mathbb {C}\),
by (29) and (31), the first integrand can be estimated as follows
Because
we obtain
Furthermore, by (26),
which together with (32) implies
The third integral is equal zero because the integrand is an odd function. The last one, by (32), we can estimate
By putting estimates (33), (34) and (35) together, we obtain
Finally, by (8) and Theorem 2.2, there is \(C > 0\) such that for all \(\delta \in \mathcal {M}\) and any \(u \in \mathbb {R}^d\),
Hence,
which concludes the proof of Claim 4. \(\square \)
Although, the asymptotic in Theorem 3.1 is uniform on a large region with respect to n and x, it depends on the implicit function \(s(\delta )\). By (36), we may estimate
Since \(\mathcal {M}\ni \delta \mapsto s(\delta )\) is real analytic, for each \(\epsilon > 0\) there is \(C_\epsilon > 0\) such that if \({\text {dist}}(\delta , \partial \mathcal {M}) \ge \epsilon \) then
and
where \(\delta _0 = \sum _{v \in \mathcal {V}} p(v) v\). In most applications the following form of the asymptotic of p(n; x) is sufficient.
Corollary 3.2
For every \(\epsilon > 0\), \(j \in \{0, \ldots , r-1\}\), \(n \in \mathbb {N}\) and \(x \in X_j\), if \(n \equiv j \pmod r\) then
otherwise \(p(n; x) = 0\), provided that \({\text {dist}}(\delta , \partial \mathcal {M}) \ge \epsilon \).
Remark 1
It is not possible to replace \(\phi (\delta )\) by \(\frac{1}{2} B_0^{-1}(\delta - \delta _0, \delta - \delta _0)\) without introducing an error term of a very different nature. Indeed, by (12),
Since \(\delta _0 \in \mathcal {M}\), if \(\delta \) approaches \(\partial \mathcal {M}\) then \(n {\left|\delta - \delta _0 \right|}^3\) cannot be small. Notice that the third power may be replaced by a higher degree if the random walk has vanishing moments. In particular, for the simple random walk on \(\mathbb {Z}^d\) (see Example 1), for all \(\epsilon > 0\), \(x \in \mathbb {Z}^d\) and \(n \in \mathbb {N}\), if \({\left|x \right|}_1 + n \in 2 \mathbb {N}\) then
otherwise \(p(n; x) = 0\), uniformly with respect to n and x provided that \({\left|x \right|}_1 \le (1-\epsilon ) n\).
Remark 2
It is relatively easy to obtain a global upper bound: for all \(n \in \mathbb {N}\) and \(x \in \mathbb {Z}^d\),
Indeed, by Claim 2, for \(u \in \mathbb {R}^d\), we have
Hence, by Theorem 2.1,
Notes
For \(x \in \mathbb {R}^d\) and \(p \in (1, \infty )\) we set \({\left|x \right|}_p = \big ({|{x_1} |}^p + \cdots + {|{x_d} |}^p\big )^{1/p}\).
\(A \asymp B\) means that \(c B \le A \le C B\), for some constants \(c,C>0\).
References
Bendikov, A., Cygan, W., Trojan, B.: Limit theorems for random walks. Stoch. Proc. Appl. 127, 3268–3290 (2017)
Borovkov, A.A., Mogulskii, A.A.: On large and superlarge deviations of sums of independent random vectors under Cramér’s conditions I. Theory Probab. Appl. 51(2), 227–255 (2007)
Davis, E.B.: Large deviation for heat kernels on graphs. J. Lond. Math. Soc. 2, 65–72 (1993)
Guivarc’h, Y.: Application d’un theoreme limite local a la transience et a la recurrence de marches de markov. In: Gabriel Mokobodzki, G., Pinchon, D. (eds.) Théorie du Potentiel, Orsay 1983, Volume 1096 of Lect. Notes Math., pp. 301–332. Springer, Berlin (1984)
Ishiwata, S., Kawabi, H., Kotani, M.: Long time asymptotics of non-symmetric random walks on crystal lattice. J. Funct. Anal. 272, 1553–1624 (2017)
Kotani, M., Sunada, T.: Albanese maps and off diagonal long time asymptotics for the heat kernel. Commun. Math. Phys. 209, 633–670 (2000)
Krámli, A., Szász, D.: Random walks with internal degrees of freedom. Z. Wahrsch. Verw. Gebiete 63, 85–95 (1983)
Lawler, G.F.: Intersections of Random Walks. Probability and Its Applications. Birkhäuser, Basel (1991)
Lawler, G.F., Limic, V.: Random Walks: A Modern Introduction. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2010)
Ney, P., Spitzer, F.: Martin boundary for random walk. Trans. Am. Math. Soc 121(1), 116–132 (1966)
Pólya, G.: Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Strassennetz. Math. Ann. 84, 149–160 (1921)
Smith, W.L.: A frequency function form of the central limit theorem. Proc. Camb. Philos. Soc. 49, 462–472 (1953)
Spitzer, F.: Principles of Random Walk. Graduate Texts in Mathematics. Springer, Berlin (1964)
Trojan, B.: Asymptotic behaviour of heat kernels and Green functions on affine buildings. Preprint (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Constantin.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A. Applications
Appendix A. Applications
In this section we apply Corollary 3.2 to the simple random walks on triangular and hexagonal lattices.
1.1 A.1 The triangular lattice
The triangular lattice consists of the set of points
where \(\lambda _1 = (-1/2, \sqrt{3}/2)\), \(\lambda _2 = (1/2, \sqrt{3}/2)\). Let \(\tau : L \rightarrow \{0, 1, 2\}\) be defined by setting
Each point \(x \in L\) has six closest neighbors, namely,
Let p be the transition function of the simple random walk on L. Observe that the mapping
allows us instead of p to work with a transition function \(\tilde{p}\) such that
Then the corresponding set \(\mathcal {M}\subset \mathbb {R}^2\) is the interior of
Moreover, for \(u \in \mathbb {R}^2\),
In particular, \(\mathcal {U}= \{0\}\). Next, by using (8) we can compute the quadratic form \(B_0\),
thus \(\det B_0 = 1/3\). Finally, by applying Corollary 3.2 to \(\tilde{p}\) we obtain the following precise asymptotic of p: for every \(\epsilon > 0\) and all \(n \in \mathbb {N}\) and \(x \in L\),
uniformly with respect to n and x such that \({\text {dist}}(\delta , \partial \mathcal {M}) \ge \epsilon \) where for \(x =j \lambda _1 + j' \lambda _2\) we have set
The asymptotic (38) is valid in the region where \({\left|x \right|}_1 = o(n)\), which improves on previously known results (see [6, Example 2] and [5, Theorem 2.5 and Section 7.2]).
1.2 A.2 The hexagonal lattice
The hexagonal lattice H one may obtain from the triangular lattice by removing all vertices \(x \in L\) such that \(\tau (x) = 1\). Each vertex \(x \in H\) has three neighbors,
Let p be the transition function of the simple random walk on H, i.e. \(p(x, y) = 1/3\) if x and y are closest neighbors. Observe that p is irreducible and periodic with period \(r = 2\). We have
Let us consider a new random walk given by a transition function q,
where the sum is taken over \(u \in H\) being a common neighbor of x and y. It is easy to check that \(q(x, x) = 1/3\) and \(q(x, y) = 1/9\) where y belongs to the set
If \(x \in X_0\) then
If \(x \in X_1\) and \(n \equiv 1 \pmod 2\) then
otherwise \(p(n; 0, x) = 0\). First, we find the asymptotic of q. We notice that q is the transition function of an irreducible random walk on the triangular lattice
Therefore, under the mapping
the transition function q is mapped onto \(\tilde{q}\) a transition function of a random walk on the integer lattice \(\mathbb {Z}^2\), where
In this case, for \(u \in \mathbb {R}^2\) we have
Again, the set \(\mathcal {M}\subset \mathbb {R}^2\) is the interior of
It is easy to check that the quadratic form \(B_0\) equals to
thus \(\det B_0 = 4/27\). By Corollary 3.2, for every \(\epsilon > 0\), all \(n \in \mathbb {N}\) and \(x \in L\),
uniformly with respect to n and x such that \({\text {dist}}(\delta , \partial \mathcal {M}) \ge \epsilon \) where for \(x = j \lambda _1 + j' \lambda _2\) we have set
Although, for \(x \in X_1\), we need to apply (39) for three times with different x, the exponential factors are comparable. Indeed, for \(x \in H\), \(x = j \lambda _1 + j' \lambda _2\) let \(\delta \) be defined by the formula (40). Fix \(\epsilon > 0\) and let us consider \(x \in X_1\) and \(n \in \mathbb {N}\) such that
Let \(\tilde{\delta }\) be any element of a set
Observe that
Let us denote by \(s \in \mathbb {R}^2\) the unique solution to \(\nabla \log \kappa (s) = \delta \), then by (10), we can estimate
Hence, by (37) and (41), we get
In particular,
Now, we are ready to apply (39) to obtain the precise asymptotic of p. For every \(\epsilon > 0\) and all \(x \in H\), \(n \in \mathbb {N}\), \(j \in \{0, 1\}\), if \(x \in X_j\) then
uniformly with respect to n and x such that \({\text {dist}}(\delta , \partial \mathcal {M}) \ge \epsilon \).
Let us observe that the above asymptotic is valid on a region where \({\left|x \right|}_1 = o(n)\), improving on results available in the literature (see [5, Theorem 2.5 and Section 7.3] and [6, Example 3]).
Rights and permissions
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.
About this article
Cite this article
Trojan, B. Long time behavior of random walks on the integer lattice. Monatsh Math 191, 349–376 (2020). https://doi.org/10.1007/s00605-019-01316-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-019-01316-3