In between random walk and rotor walk in the square lattice
In between random walk and rotor walk in the square lattice
-
Swee Hong Chan, Cornell University.
How much randomness is needed to prove听 a scaling limit result?
In this talk we听 consider this question for a family of random walks on the square lattice.
When the randomness is turned to the maximum, we have听 the symmetric random walk, which is known to scale to a two-dimensional Brownian motion.
When the randomness is turned to zero,听 we have听 the rotor walk, for which its scaling limit is an open problem.
This talk is about听 random walks that lie in between these two extreme cases and听 for which we can prove their scaling limit.
This is a joint work with Lila Greco, Lionel Levine, and Boyao Li.