Translator Disclaimer
2012 Bounds for the annealed return probability on large finite percolation graphs
Florian Sobieczky
Author Affiliations +
Electron. J. Probab. 17: 1-17 (2012). DOI: 10.1214/EJP.v17-2329

Abstract

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation and the associated heavy-tailed cluster size distributions. The upper bound relies on the fact that cartesian products of finite graphs with cycles of a certain minimal size are Hamiltonian. For critical Bernoulli bond percolation on the homogeneous tree this bound is sharp. The asymptotic type of the expected return probability for large times $t$ in this case is of order $t^{-3/4}$.

Citation

Download Citation

Florian Sobieczky. "Bounds for the annealed return probability on large finite percolation graphs." Electron. J. Probab. 17 1 - 17, 2012. https://doi.org/10.1214/EJP.v17-2329

Information

Accepted: 21 September 2012; Published: 2012
First available in Project Euclid: 4 June 2016

zbMATH: 1260.05149
MathSciNet: MR2981904
Digital Object Identifier: 10.1214/EJP.v17-2329

Subjects:
Primary: 47B80
Secondary: 05C81, 60J27, 60K35

JOURNAL ARTICLE
17 PAGES


SHARE
Vol.17 • 2012
Back to Top