Upper bounds for the critical probability of oriented percolation in two dimensions

1993 ◽  
Vol 440 (1908) ◽  
pp. 201-220 ◽  
Keyword(s):  
Upper Bound ◽  
Upper Bounds ◽  
Two Dimensions ◽  
Oriented Percolation ◽  
Bond Percolation ◽  
Critical Probability ◽  
Site Percolation

We give a method for obtaining upper bounds on the critical probability in oriented bond percolation in two dimensions. This method enables us to prove that the critical probability is at most 0.6863, greatly improving the best published upper bound, 0.84. We also prove that our method can be used to give arbitrarily good upper bounds. We also use a slight variant of our method to obtain an upper bound of 0.72599 for the critical probability in oriented site percolation.

Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains

1997 ◽  
Vol 34 (04) ◽  
pp. 859-867
Author(s):  
Béla Bollabás ◽  
Alan Stacey
Keyword(s):  
Monte Carlo ◽  
Markov Chains ◽  
Monte Carlo Simulations ◽  
Statistical Tests ◽  
Upper Bounds ◽  
Two Dimensions ◽  
Oriented Percolation ◽  
Critical Probability ◽  
Confidence Levels

We develop a technique for establishing statistical tests with precise confidence levels for upper bounds on the critical probability in oriented percolation. We use it to give pc < 0.647 with a 99.999967% confidence. As Monte Carlo simulations suggest that pc ≈ 0.6445, this bound is fairly tight.

Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains

1997 ◽  
Vol 34 (4) ◽  
pp. 859-867 ◽  
Author(s):  
Béla Bollabás ◽  
Alan Stacey
Keyword(s):  
Monte Carlo ◽  
Markov Chains ◽  
Monte Carlo Simulations ◽  
Statistical Tests ◽  
Upper Bounds ◽  
Two Dimensions ◽  
Oriented Percolation ◽  
Critical Probability ◽  
Confidence Levels

We develop a technique for establishing statistical tests with precise confidence levels for upper bounds on the critical probability in oriented percolation. We use it to givepc< 0.647 with a 99.999967% confidence. As Monte Carlo simulations suggest thatpc≈ 0.6445, this bound is fairly tight.

Percolation on Penrose Tilings

1998 ◽  
Vol 41 (2) ◽  
pp. 166-177 ◽  
Author(s):  
A. Hof
Keyword(s):  
Large Class ◽  
Arbitrary Dimension ◽  
Bond Percolation ◽  
Critical Probability ◽  
Site Percolation ◽  
Aperiodic Tilings ◽  
Infinite Clusters ◽  
Almost All ◽  
Percolation Processes ◽  
Penrose Tilings

AbstractIn Bernoulli site percolation on Penrose tilings there are two natural definitions of the critical probability. This paper shows that they are equal on almost all Penrose tilings. It also shows that for almost all Penrose tilings the number of infinite clusters is almost surely 0 or 1. The results generalize to percolation on a large class of aperiodic tilings in arbitrary dimension, to percolation on ergodic subgraphs of ℤd, and to other percolation processes, including Bernoulli bond percolation.

Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model

1995 ◽  
Vol 4 (2) ◽  
pp. 181-188 ◽  
Author(s):  
John C. Wierman
Keyword(s):  
Upper Bound ◽  
Lattice Site ◽  
Percolation Model ◽  
Square Lattice ◽  
Critical Probability ◽  
Site Percolation ◽  
Substitution Method ◽  
Probability Bounds

The square lattice site percolation model critical probability is shown to be at most .679492, improving the best previous mathematically rigorous upper bound. This bound is derived by extending the substitution method to apply to site percolation models.

An Improved Upper Bound for the Hexagonal Lattice Site Percolation Critical Probability

2002 ◽  
Vol 11 (6) ◽  
pp. 629-643 ◽  
Author(s):  
JOHN C. WIERMAN
Keyword(s):  
Upper Bound ◽  
Lattice Site ◽  
Hexagonal Lattice ◽  
Critical Probability ◽  
Site Percolation ◽  
Substitution Method ◽  
Site Model ◽  
Bond Model

The hexagonal lattice site percolation critical probability is shown to be at most 0.79472, improving the best previous mathematically rigorous upper bound. The bound is derived by using the substitution method to compare the site model with the bond model, the latter of which is exactly solved. Shortcuts which eliminate a substantial amount of computation make the derivation of the bound possible.

scholarly journals Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel

2013 ◽  
Vol 13 (9&10) ◽  
pp. 793-826
Author(s):  
Nicolas Delfosse ◽  
Gilles Zemor
Keyword(s):  
Upper Bound ◽  
Percolation Theory ◽  
Hyperbolic Plane ◽  
Upper Bounds ◽  
Low Density ◽  
Critical Probability ◽  
Stabilizer Codes ◽  
Erasure Channel ◽  
Finite Quotients ◽  
Quantum Erasure

Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, $R \leq 1-2p$, for stabilizer codes: we also derive an improved upper bound of the form $R \leq 1-2p-D(p)$ with a function $D(p)$ that stays positive for $0<p<1/2$ and for any family of stabilizer codes whose generators have weights bounded from above by a constant -- low density stabilizer codes. We obtain an application to percolation theory for a family of self-dual tilings of the hyperbolic plane. We associate a family of low density stabilizer codes with appropriate finite quotients of these tilings. We then relate the probability of percolation to the probability of a decoding error for these codes on the quantum erasure channel. The application of our upper bound on achievable rates of low density stabilizer codes gives rise to an upper bound on the critical probability for these tilings.

Estimates of critical percolation probabilities for a set of two-dimensional lattices

1972 ◽  
Vol 71 (1) ◽  
pp. 97-106 ◽  
Author(s):  
D. G. Neal
Keyword(s):  
Monte Carlo ◽  
Two Dimensions ◽  
Two Dimensional ◽  
Critical Percolation ◽  
Site Percolation

AbstractThis paper describes new detailed Monte Carlo investigations into bond and site percolation problems on the set of eleven regular and semi-regular (Archimedean) lattices in two dimensions.

Upper bounds on the energy dissipation in turbulent precession

1996 ◽  
Vol 321 ◽  
pp. 335-370 ◽  
Author(s):  
R. R. Kerswell
Keyword(s):  
Experimental Data ◽  
Energy Dissipation ◽  
Viscous Dissipation ◽  
Upper Bound ◽  
Dissipation Rate ◽  
Oblate Spheroid ◽  
Upper Bounds ◽  
Precession Rate ◽  
Long Cylinder

Rigorous upper bounds on the viscous dissipation rate are identified for two commonly studied precessing fluid-filled configurations: an oblate spheroid and a long cylinder. The latter represents an interesting new application of the upper-bounding techniques developed by Howard and Busse. A novel ‘background’ method recently introduced by Doering & Constantin is also used to deduce in both instances an upper bound which is independent of the fluid's viscosity and the forcing precession rate. Experimental data provide some evidence that the observed viscous dissipation rate mirrors this behaviour at sufficiently high precessional forcing. Implications are then discussed for the Earth's precessional response.

Sign in / Sign up

Export Citation Format

Share Document