Return probabilities of a simple random walk on percolation clusters

17Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

The critical probability of bond percolation on the square lattice equals 1/2

405Citations
N/AReaders
Get full text

Density and uniqueness in percolation

270Citations
N/AReaders
Get full text

A note on percolation

184Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Processes on unimodular random networks

291Citations
N/AReaders
Get full text

Recent progress on the Random Conductance Model

131Citations
N/AReaders
Get full text

Quenched invariance principle for simple random walk on percolation clusters

130Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

67%

Professor / Associate Prof. 1

17%

Researcher 1

17%

Readers' Discipline

Tooltip

Physics and Astronomy 2

33%

Engineering 2

33%

Computer Science 1

17%

Agricultural and Biological Sciences 1

17%

Save time finding and organizing research with Mendeley

Sign up for free