Toronto Probability
by Gady Kozma (Weizmann Institute of Science)
Once reinforced random walk is the simplest self-interacting random walk one can imagine. The walker has some preference to edges it had already traversed, compared to new edges, regardless of how many times they were traversed. We will discuss the history of the problem and a recent result (with Dor Elboim) that in high dimension and low reinforcement the walk looks like Brownian motion. All terms will be explained in the talk.
