heuristic for expected number of visits random walk

230 Views Asked by At

What is the heuristic argument that explains why, on $\mathbb{Z}^d$, $d \geq 3$, the expected number of visits of a random walk starting from the origin at $x$ is of order $$ O(|x|^{2-d})? $$