Tutorials › Stochastic Processes › Periodicity and Even-Time Returns on the Lattice

Random Walks in Higher Dimensions · Tutorial 328 of 994

Periodicity and Even-Time Returns on the Lattice

Learn why odd-time returns vanish, how period two appears in the Fourier symbol, and how to sum return probabilities without losing divergence.

Advanced 10 min read

What You'll Learn

  • Define the simple symmetric nearest-neighbor walk and its return probabilities.
  • Prove that returns occur only at even times and that the period is two.
  • Derive the Fourier inversion formula and use a torus shift to explain odd-time cancellation.
  • Express the full return-probability sum as an extended-valued integral.
  • Identify a geometric-series error at the Fourier point where the symbol equals minus one.
  • Prove divergence of the one-dimensional return-probability sum by an elementary bound.

Parity, Period, and Fourier Summation

A simple symmetric walk on a lattice alternates between two classes of sites: those whose coordinate sum is even and those whose coordinate sum is odd. This elementary parity fact has an important Fourier counterpart. The Fourier symbol takes the value \(1\) at one point of the torus and \(-1\) at the point shifted by \(\pi\) in every coordinate. Summing only the even powers keeps both values visible; replacing that sum too quickly by a geometric series can obscure the periodicity or mishandle an infinite return-probability sum.

Fix a dimension \(d\ge1\). On a probability space \((\Omega,\mathcal F,\mathbb P)\), let \((Y_n)_{n\ge1}\) be independent increments, each uniform on \(\{e_1,-e_1,\ldots,e_d,-e_d\}\), where \(e_j\) is the \(j\)th coordinate vector. Set \(X_0=0\) and \(X_n=\sum_{r=1}^nY_r\). This is a discrete-time Markov chain with state space \(S=\mathbb Z^d\). From every \(x\in S\), each of its \(2d\) nearest neighbors has transition probability \(1/(2d)\), and all other transition probabilities are zero. Thus every transition-kernel row sums to \(2d\cdot1/(2d)=1\). Write \(p_n=\mathbb P_0(X_n=0)\) for the return probability at time \(n\).

Definition: For a state \(i\), its period is the greatest common divisor of the positive integers \(n\) for which \(p_{ii}^{(n)}>0\). The chain is periodic with period \(r\) if this greatest common divisor is \(r\). For this walk, translation invariance makes the period the same at every state.

The period concerns possible return times, not whether return is certain, nor how large a return probability is. The first return time \(T_0^+=\inf\{n\ge1:X_n=0\}\) is also distinct from \(p_n\): the latter is the probability of being at the origin at a specified time and does not require that the walk avoided the origin earlier.

Theorem: For the simple symmetric nearest-neighbor walk on \(\mathbb Z^d\), \(p_n=0\) for every odd \(n\), every positive even return time has positive probability, and the period of the chain is \(2\).

Proof. Each step changes the coordinate sum \(x_1+\cdots+x_d\) by \(1\) or \(-1\), so it changes the parity of that sum. Starting from any state, after an odd number of steps the walk is in the opposite parity class and cannot be back at its starting state. Hence all odd-time return probabilities are zero. For any integer \(m\ge1\), the path that alternates \(e_1,-e_1\) exactly \(m\) times returns after \(2m\) steps and has probability \((1/(2d))^{2m}>0\). Thus the possible positive return times are exactly the positive even integers. Their greatest common divisor is \(2\), proving the claim. \(\square\)

The Fourier Symbol and the Parity Shift

For \(\theta=(\theta_1,\ldots,\theta_d)\in[-\pi,\pi)^d\), define the Fourier symbol \(\phi(\theta)=\mathbb E[e^{\,i\theta\cdot Y_1}]\). The two steps in coordinate \(j\) contribute \(e^{i\theta_j}\) and \(e^{-i\theta_j}\), each with probability \(1/(2d)\), so \(\phi(\theta)=d^{-1}\sum_{j=1}^d\cos\theta_j\). In particular, \(-1\le\phi(\theta)\le1\).

Integrals over the torus below use normalized measure \(d\theta/(2\pi)^d\). Fourier inversion here follows directly from the identity that the normalized integral of \(e^{i\theta\cdot x}\) is \(1\) for \(x=0\) and \(0\) for every nonzero \(x\in\mathbb Z^d\). Indeed, for each fixed lattice point \(x\), that integral factors into one-dimensional integrals, and a nonzero coordinate contributes \((2\pi)^{-1}\int_{-\pi}^{\pi}e^{ik\theta}\,d\theta=0\) for a nonzero integer \(k\). Applying this identity to \(X_n\) and using independence of the increments gives the return formula.

$$ p_n=\int_{[-\pi,\pi)^d}\phi(\theta)^n\,\frac{d\theta}{(2\pi)^d}. $$

Let \(\mathbf{\pi}=(\pi,\ldots,\pi)\), with coordinates interpreted modulo \(2\pi\) on the torus. Since \(\cos(\theta_j+\pi)=-\cos\theta_j\), the symbol satisfies \(\phi(\theta+\mathbf{\pi})=-\phi(\theta)\). Translation by \(\mathbf{\pi}\) preserves normalized torus measure. Thus the integral of \(\phi^n\) equals the integral of \((-\phi)^n\). For odd \(n\), this integral is its own negative and must be zero. This Fourier cancellation agrees with the pathwise parity proof; it does not mean that \(\phi(\theta)^n\) is zero at each \(\theta\).

Worked Example: Two-Step Returns in Any Dimension

Compute \(p_2\) from the Fourier formula and check it by counting paths. The transition probabilities are \(1/(2d)\) to each of \(2d\) neighbors, so a row sums to \(2d/(2d)=1\).

Squaring the symbol gives \(\phi(\theta)^2=d^{-2}\sum_{j,k=1}^d\cos\theta_j\cos\theta_k\). When \(j\ne k\), the normalized torus integral of the product is zero: the integral factors, and each single cosine has integral zero. When \(j=k\), the normalized integral of \(\cos^2\theta_j\) is \(1/2\). There are \(d\) diagonal terms, hence \(p_2=d^{-2}\cdot d\cdot(1/2)=1/(2d)\).

Check by paths. There are \(2d\) possible first steps, each with probability \(1/(2d)\). Exactly one of the \(2d\) equally likely second steps reverses the first. Conditional on any first step, the chance of returning on the second step is \(1/(2d)\), so the unconditional return probability is also \(1/(2d)\), as computed by integration.

Worked Example: Four-Step Returns on the Square Lattice

Take \(d=2\), so the four neighbors each have probability \(1/4\), and the transition row sum is \(4\cdot1/4=1\). Count the four-step return paths from the origin.

One possibility is to use just one coordinate axis: choose which of the two axes is used, then choose the two positions occupied by the positive step along that axis. This gives \(2\binom42=12\) paths. The other possibility uses one step in each of the four directions \(e_1,-e_1,e_2,-e_2\), in any order, giving \(4!=24\) paths. These cases are disjoint and exhaust the returns: in each coordinate, the number of positive and negative steps must match. Thus there are \(12+24=36\) return paths out of \(4^4=256\) equally likely paths, and \(p_4=36/256=9/64\).

Fourier check. Here \(\phi=(\cos\theta_1+\cos\theta_2)/2\). Expanding its fourth power, the terms containing an odd power of either cosine integrate to zero. The remaining terms give \(\int\phi^4=2^{-4}\bigl(2\cdot(3/8)+6\cdot(1/2)^2\bigr)\). Since the normalized integrals of \(\cos^4\theta_j\) and \(\cos^2\theta_j\) are \(3/8\) and \(1/2\), respectively, this is \(2^{-4}(3/4+3/2)=2^{-4}(9/4)=9/64\), agreeing with the path count.

Summing the Return Probabilities Without Losing Divergence

Define the return-probability sum, including the time-zero visit, by \(G=\sum_{n=0}^{\infty}p_n\), with the value \(+\infty\) allowed. Odd-time terms vanish, so \(G=\sum_{m=0}^{\infty}p_{2m}\). For a finite cutoff \(M\), Fourier inversion and linearity of a finite sum give \(\sum_{m=0}^{M}p_{2m}=\int\sum_{m=0}^{M}\phi(\theta)^{2m}\,d\theta/(2\pi)^d\). Since \(0\le\phi^2\le1\), these finite sums of even powers increase pointwise as \(M\) increases. The Monotone Convergence Theorem, a standard measure-theoretic result, therefore permits taking the increasing limit inside the integral, including when the result is infinite.

Theorem: For the simple symmetric nearest-neighbor walk on \(\mathbb Z^d\), the full return-probability sum has the extended-valued representation \[ G=\int_{[-\pi,\pi)^d}\frac{1}{1-\phi(\theta)^2}\,\frac{d\theta}{(2\pi)^d}. \] At points where \(\phi(\theta)^2=1\), the integrand is defined to be \(+\infty\). The integral, and hence \(G\), may be infinite.

Proof. For each \(M\), the finite geometric-sum identity gives \(\sum_{m=0}^{M}\phi^{2m}=(1-\phi^{2M+2})/(1-\phi^2)\) wherever \(\phi^2\ne1\). If \(\phi^2=1\), the sum is \(M+1\). In either case, as \(M\) increases the sum increases to \(1/(1-\phi^2)\) when \(\phi^2<1\), and to \(+\infty\) when \(\phi^2=1\). Integrating the finite sums gives \(\sum_{m=0}^M p_{2m}\). Applying the Monotone Convergence Theorem to this nonnegative increasing sequence shows that its integral increases to the integral of the pointwise limit. The left side increases to \(G\), proving the formula in the extended sense. \(\square\)

This order of operations matters. Each even-power term is nonnegative, so the monotone limit retains the full value of the sum, including divergence. The formula describes the return-probability sum; it does not, by itself, say whether the integral is finite in a particular dimension. The behavior near points where \(|\phi|=1\) requires a separate integrability analysis.

Worked Example: Divergence of the One-Dimensional Return Sum

In dimension \(d=1\), every step is \(+1\) or \(-1\), each with probability \(1/2\), so the transition probabilities sum to \(2\cdot1/2=1\). At time \(2m\), a return requires exactly \(m\) positive and \(m\) negative steps. Therefore \(p_{2m}=\binom{2m}{m}/2^{2m}=\binom{2m}{m}/4^m\).

The central binomial coefficient is the largest among \(\binom{2m}{k}\), \(0\le k\le2m\): the ratio of consecutive coefficients is \(\binom{2m}{k+1}/\binom{2m}{k}=(2m-k)/(k+1)\), which is at least \(1\) up to the middle and at most \(1\) after it. Since the \(2m+1\) coefficients sum to \(2^{2m}=4^m\), their largest is at least their average. Hence \(p_{2m}\ge1/(2m+1)\).

To verify divergence without relying on an asymptotic approximation, group the terms with \(2^r\le m<2^{r+1}\), for integers \(r\ge0\). There are \(2^r\) terms in this block, and each satisfies \(2m+1\le2^{r+2}\). The block sum is therefore at least \(2^r/2^{r+2}=1/4\). Infinitely many disjoint blocks each contribute at least \(1/4\), so \(\sum_{m\ge1}p_{2m}\) diverges. Adding \(p_0=1\) does not change that conclusion.

Fourier consistency check. For \(d=1\), \(\phi(\theta)=\cos\theta\), and the return-sum integrand is \(1/(1-\cos^2\theta)\). The integral representation allows the value \(+\infty\); the path-count bound above independently confirms that the return-probability sum is indeed infinite.

A Common Fourier Pitfall

A tempting but incorrect step is to replace the even-power sum by \(1/(1-\phi)\). The geometric series for that expression sums powers \(\phi^n\), not just the even powers, and its pointwise behavior at \(\phi=-1\) does not represent the even series. For a concrete check, in dimension one at \(\theta=\pi\), \(\phi(\pi)=\cos\pi=-1\). The finite even-power sum is \(\sum_{m=0}^M(-1)^{2m}=M+1\), whereas \(1/(1-\phi(\pi))=1/2\). The correct even-power denominator is \(1-\phi^2\), with value \(+\infty\) at \(\phi^2=1\) in the limiting sum.

There is a related mistake in the odd-time Fourier calculation: \(\phi(\theta)^n\) is not pointwise zero for odd \(n\). For instance, in dimension one at \(\theta=\pi/3\), \(\phi(\theta)^3=(1/2)^3=1/8\). What vanishes is its integral, because shifting every torus coordinate by \(\pi\) changes its sign while preserving the measure. Keeping the distinction between pointwise values and integrated cancellation is essential when using Fourier formulas for periodic walks.

Check Your Understanding

Use the parity argument and Fourier formulas to justify your answers.

  1. Why can a walk started at a site with odd coordinate sum not return there after one step?
  2. For \(d=3\), compute \(p_2\) using the general formula and state how many neighbors each transition row has.
  3. Explain why the integral of \(\phi^n\) is zero for odd \(n\), even though \(\phi^n\) need not vanish pointwise.
  4. Why does summing the even powers retain divergence more safely than summing signed powers and then taking a pointwise geometric limit?
  5. In dimension one, what lower bound on \(p_{2m}\) follows from the average of the \(2m+1\) binomial coefficients?