Abstract
We present a coupled decreasing sequence of random walks on Z that dominate the edge process of oriented bond percolation in two dimensions. Using the concept of random walk in a strip, we describe an algorithm that generates an increasing sequence of lower bounds that converges to the critical probability of oriented percolation pc. From the 7th term on, these lower bounds improve upon 0.6298, the best rigorous lower bound at present, establishing 0.63328 as a rigorous lower bound for pc. Finally, a Monte Carlo simulation technique is presented; the use thereof establishes 0.64450 as a non-rigorous five-digit-precision (lower) estimate for pc.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Durrett, Oriented Percolation in Two Dimensions. The Annals of Probability 12(4):999–1040 (1984).
R. Durrett, Lecture Notes on Particle Systems and Percolation. Wadsworth & Brooks/Cole (1988).
G. Grimmett, Percolation. Springer Verlag (1999).
G. Fayolle, V.A. Malyshev, M.V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press (1995).
R. G. Bartle, The Elements of Integration and Lebesgue Measure. John Willey & Sons Inc (1995).
J. H. Wilkinson, Rounding Errors in Algebraic Processes. Her Majesty's Stationary Office (1963).
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (1991): 60K35
Supported by CNPq (grant N.301637/91-1).
Supported by a grant from CNPq.
Rights and permissions
About this article
Cite this article
Belitsky, V., Ritchie, T.L. Improved Lower Bounds for the Critical Probability of Oriented Bond Percolation in Two Dimensions. J Stat Phys 122, 279–302 (2006). https://doi.org/10.1007/s10955-005-8022-x
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10955-005-8022-x