The Uniform Random Walk on graphs, loop processes and graphings

Miklos Abert, Adam Arras, Jaelin Kim

We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists,…