For simple random walk on , , the Green-function decay for simple random walk on the integer lattice and the Strong Markov property give
The series over converges, so the first of the Borel-Cantelli lemmas says that almost surely only finitely many of the points are ever hit. Moreover, is a transient graph for , so each of those finitely many points is visited only finitely often. Therefore the simple random walk visits only finitely often almost surely:
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.