Random walk on the range of random walk (Q842333)

Given a simple random walk on \(\mathbb{Z}^d\) starting from \(0\). By defining its vertex set end the related edge set, the range of the random walk is identified with a corresponding graph. For almost every random walk path, the graph is infinite, connected and of a bounded degree. The main object of study is the discrete time simple random walk on the pertinent graph, when \(d \geq 4\). For \(d\geq 5\) the quenched annealing scaling limits for the stochastic process are established. For \(d=4\) it is shown that any scaling limit will require logarithmic corrections to the polynomial factors, seen in higher dimensions. Links with physics-motivated sub-critical percolation models are mentioned.