Improved Lower Bounds for the Critical Probability of Oriented-Bond Percolation in Two Dimensions

Simple item page
dc.creatorRitchie, Thomas Logan
dc.creatorBelitsky, Vladimir
dc.date2004-12-17
dc.date.accessioned2026-07-07T05:15:24Z
dc.date.available2026-07-07T05:15:24Z
dc.descriptionWe present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that generates an increasing sequence of lower bounds that converges to the critical probability of oriented-bond percolation. Numerical calculations of the first ten lower bounds thereby generated lead to an improved,i.e. higher, rigorous lower bound to this critical probability, viz. $p_{c} \geq 0.63328 $. Finally a computer simulation technique is presented; the use thereof establishes 0.64450 as a non-rigorous five-digit-precision (lower) estimate for $p_{c}$.
dc.description16 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0412348
dc.identifierhttp://arxiv.org/abs/math/0412348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73616
dc.subjectProbability
dc.subjectMathematical Physics
dc.subject60K35
dc.titleImproved Lower Bounds for the Critical Probability of Oriented-Bond Percolation in Two Dimensions
dc.typetext

Files

Collections

arXiv