We bound the probability that a continuous time simple random walk on the infinite percolation cluster on ℤd returns to the origin at time t. We use this result to show that in dimensions 5 and higher the uniform spanning forest on infinite percolation clusters supported on graphs with infinitely many connected components a.s. © 2005 Applied Probability Trust.
CITATION STYLE
Heicklen, D., & Hoffman, C. (2005). Return probabilities of a simple random walk on percolation clusters. Electronic Journal of Probability, 10, 250–302. https://doi.org/10.1214/EJP.v10-240
Mendeley helps you to discover research relevant for your work.