Random Walks in 2D: Recurrence of (a), (b), (c)

  • Thread starter Thread starter davidmoore63@y
  • Start date Start date
  • Tags Tags
    2d Random
Click For Summary
SUMMARY

This discussion analyzes the recurrence properties of three types of 2D random walks: (a) on a square lattice, (b) on a triangular lattice, and (c) with a direction chosen uniformly from U[0, 2π). It is established that the square lattice walk (a) is recurrent, returning to the origin with probability 1. The triangular lattice walk (b) is also determined to be recurrent due to its infinite resistance to infinity, despite having more choices per step. In contrast, the walk (c) is transient as it has zero measure at the origin, despite the infinite resistance of the underlying space.

PREREQUISITES
  • Understanding of random walks in probability theory
  • Familiarity with lattice structures, specifically square and triangular lattices
  • Basic knowledge of electrical resistance concepts in relation to probability
  • Experience with uniform distributions, particularly U[0, 2π)
NEXT STEPS
  • Research the mathematical properties of random walks on triangular lattices
  • Explore the concept of resistance in electrical circuits as it relates to recurrence in random walks
  • Study the implications of zero measure in probability theory, particularly in relation to transient walks
  • Investigate the differences between 2D and 3D random walks and their recurrence properties
USEFUL FOR

Mathematicians, statisticians, and researchers in probability theory, particularly those interested in the properties of random walks and their applications in various fields.

davidmoore63@y
Messages
92
Reaction score
17
Consider the following random walks in 2D, starting at a point we will call the origin:
(a) random walk on a square lattice (step size 1 on the integer lattice for example)
(b) random walk on a triangular lattice (step size 1 on the lattice of equilateral triangles of side 1). Thus there are 6 equiprobable choices for each step in this walk
(c) random walk of step size 1 but with a direction selected from the uniform distribution U[0, 2pi).

My question is, we know that (a) is recurrent (returns to the origin with probability 1). What about (b) and (c) ? Are they recurrent or transient? Intuitively I would say (c) must be transient, but I am struggling with (b).
 
Mathematics news on Phys.org
What is your expectation about b? Can you transform it to a different lattice, maybe with different rules?

c is transient, right.
 
I would tentatively expect (b) to be transient, because (a) is borderline recurrent - as i recall the expected number of returns for (a) is sigma (1/n) thus infinite, whereas a walk with more choices ought to render the origin less likely to be hit later. Thinking about your suggestion..
 
The 3D walk on an integer lattice has 6 choices but it doesn't seem to be isomorphic - there are no ways to get back to the origin in 3 steps, unlike the triangular lattice
 
I have convinced myself that (b) is in fact recurrent, against my intuition. There is an interesting piece of work by Mare (https://math.dartmouth.edu/~pw/math100w13/mare.pdf) which refers to earlier work by Doyle and others interpreting probability of recurrence as resistance in electrical circuits! The conclusion is that a walk is recurrent if the resistance between the origin and infinity is infinite, whereas it is transient if the resistance is finite. An amazing parallel.

Using that interpretation, all 2d lattices with finite branches will be recurrent. The resistance to infinity of (b) is infinite. Because there are six choices instead of 4 in (a), the resistance is 4/6 as much for a given diameter of lattice, but 4/6 of infinity is still infinity.

Now I'm confused about (c). The resistance of an infinite disc is infinite, but the walk is transient because the origin has zero measure.
 
Interesting correlation to the resistance, I have to check that in more detail.
The infinite disk does not represent your random walk on it.
 
Noted on (c).
 

Similar threads

Undergrad Can chatgpt accurately calculate expected lengths in Pascal's triangle?
  • · Replies 66 ·
3
Replies
66
Views
7K
What is the relationship between random walks and destinations?
  • · Replies 29 ·
Replies
29
Views
2K
Random Walk in Arbitrary Dimension
  • · Replies 1 ·
Replies
1
Views
1K
Undergrad Average number of times a random walk passes a point
  • · Replies 10 ·
Replies
10
Views
2K
Hitting time of two or three parallel random walks
  • · Replies 4 ·
Replies
4
Views
5K
What is the solution for a one-dimensional random walk in potentials?
  • · Replies 1 ·
Replies
1
Views
5K
Map a one dimensional random walk to a two-state paramagnet
  • · Replies 18 ·
Replies
18
Views
3K
How Can You Fix Compilation Issues in Your 1-D Random Walk Program?
  • · Replies 11 ·
Replies
11
Views
2K
Undergrad Can Continuous Approximation Improve Understanding of 1D Random Walks?
  • · Replies 1 ·
Replies
1
Views
1K
Random (drankard) walk distance after n steps
  • · Replies 2 ·
Replies
2
Views
3K