08.10.2016 Views

Foundations of Data Science

2dLYwbK

2dLYwbK

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Random walks on lattices<br />

We now apply the analogy between random walks and current to lattices. Consider<br />

a random walk on a finite segment −n, . . . , −1, 0, 1, 2, . . . , n <strong>of</strong> a one dimensional lattice<br />

starting from the origin. Is the walk certain to return to the origin or is there some probability<br />

that it will escape, i.e., reach the boundary before returning? The probability <strong>of</strong><br />

reaching the boundary before returning to the origin is called the escape probability. We<br />

shall be interested in this quantity as n goes to infinity.<br />

Convert the lattice to an electrical network by replacing each edge with a one ohm<br />

resister. Then the probability <strong>of</strong> a walk starting at the origin reaching n or –n before<br />

returning to the origin is the escape probability given by<br />

p escape = c eff<br />

c a<br />

where c eff is the effective conductance between the origin and the boundary points and c a<br />

is the sum <strong>of</strong> the conductance’s at the origin. In a d-dimensional lattice, c a = 2d assuming<br />

that the resistors have value one. For the d-dimensional lattice<br />

p escape =<br />

1<br />

2d r eff<br />

In one dimension, the electrical network is just two series connections <strong>of</strong> n one ohm resistors<br />

connected in parallel. So as n goes to infinity, r eff goes to infinity and the escape<br />

probability goes to zero as n goes to infinity. Thus, the walk in the unbounded one dimensional<br />

lattice will return to the origin with probability one. This is equivalent to flipping<br />

a balanced coin and keeping tract <strong>of</strong> the number <strong>of</strong> heads minus the number <strong>of</strong> tails. The<br />

count will return to zero infinitely <strong>of</strong>ten.<br />

Two dimensions<br />

For the 2-dimensional lattice, consider a larger and larger square about the origin for<br />

the boundary as shown in Figure 5.9a and consider the limit <strong>of</strong> r eff as the squares get<br />

larger. Shorting the resistors on each square can only reduce r eff . Shorting the resistors<br />

results in the linear network shown in Figure 5.9b. As the paths get longer, the number<br />

<strong>of</strong> resistors in parallel also increases. The resistor between vertex i and i + 1 is really<br />

4(2i + 1) unit resistors in parallel. The effective resistance <strong>of</strong> 4(2i + 1) resistors in parallel<br />

is 1/4(2i + 1). Thus,<br />

r eff ≥ 1 + 1 + 1 + · · · = 1(1 + 1 + 1 + · · · ) = Θ(ln n).<br />

4 12 20 4 3 5<br />

Since the lower bound on the effective resistance and hence the effective resistance goes<br />

to infinity, the escape probability goes to zero for the 2-dimensional lattice.<br />

172

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!