# zbMATH — the first resource for mathematics

Improved upper bounds for the critical probability of oriented percolation in two dimensions. (English) Zbl 0807.60092
Summary: We refine the method of our previous paper [Proc. R. Soc. Lond., Ser. A 440, No. 1908, 201-220 (1993; Zbl 0783.60098)] which gave upper bounds for the critical probability in two-dimensional oriented percolation. We use our refinement to show that $$p_ c < 0.6735$$.

##### MSC:
 60K35 Interacting random processes; statistical mechanics type models; percolation theory 60C05 Combinatorial probability 82B43 Percolation
Full Text:
##### References:
 [1] Ahlswede, An inequality for the weights of two families of sets, their unions and intersections, Z. Wahrscheinl Geb 43 pp 183– (1978) · Zbl 0357.04011 [2] Balister, Upper bounds for the critical probability of oriented percolation in two dimensions, Proc. Royal Soc. London A 440 pp 201– (1993) · Zbl 0783.60098 [3] Barsky, Spatial Stochastic Processes pp 37– (1991) · doi:10.1007/978-1-4612-0451-0_3 [4] Bollobás, Random Graphs pp xiv + 447– (1985) [5] Bollobás, Combinatorics pp xii + 175– (1986) [6] Broadbent, Percolation processes I, II, Proc. Camb. Phil. Soc. 53 pp 629– (1957) · Zbl 0091.13901 [7] Durrett, Oriented percolation in two dimensions, Ann. Probab. 12 pp 999– (1984) · Zbl 0567.60095 [8] Durrett, Lecture Notes on Particle Systems and Percolation pp viii + 335– (1988) · Zbl 0659.60129 [9] Griffeath, The basic contact process, Stochastic Process Appl. 11 pp 151– (1981) · Zbl 0463.60085 [10] G. Grimmett Percolation 1989 xii + 296 [11] Harris, A lower bound for the critical probability in a certain percolation process, Proc. Camb. Phil. Soc. 56 pp 13– (1960) · Zbl 0122.36403
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.