Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-05T02:54:57.399Z Has data issue: false hasContentIssue false
  • English
  • Français

Lower bounds for the critical probability in percolation models with oriented bonds

Published online by Cambridge University Press:  14 July 2016

Lawrence Gray ,
John C. Wierman  and
R. T. Smythe
Lawrence Gray*
Affiliation:
University of Minnesota
John C. Wierman*
Affiliation:
University of Minnesota
R. T. Smythe*
Affiliation:
University of Oregon
*
∗Postal address: School of Mathematics, University of Minnesota, 127 Vincent Hall, 206 Church St. S.E., Minneapolis, MN 55455, U.S.A. Research partly supported by NSF Grants MSC 7405786 and 7701845.
∗Postal address: School of Mathematics, University of Minnesota, 127 Vincent Hall, 206 Church St. S.E., Minneapolis, MN 55455, U.S.A. Research partly supported by NSF Grants MSC 7405786 and 7701845.
∗∗Postal address: Department of Mathematics, University of Oregon, Eugene, OR 97403, U.S.A. Research partly supported by NSF Grant MSC 7701845.
Get access Rights & Permissions [Opens in a new window]

Abstract

In completely or partially oriented percolation models, a conceptually simple method, using barriers to enclose all open paths from the origin, improves the best previous lower bounds for the critical percolation probabilities.

Keywords

PERCOLATIONCRITICAL PROBABILITYCONTACT PROCESSES
Type
Research Papers
Information
Journal of Applied Probability , Volume 17 , Issue 4 , December 1980 , pp. 979 - 986
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bishir, J. (1963) A lower bound for the critical probability in the one-quadrant oriented-atom percolation process. J. R. Statist. Soc. B 25, 401–404.Google Scholar
Feller, W. (1968) An Introduction to Probability Theory and its Applications, Vol. 1, 3rd edn. Wiley, New York.Google Scholar
Frisch, H. L., Hammersley, J. M., and Welsh, D. J. A. (1962) Monte Carlo estimates of percolation probabilities for various lattices. Phys. Rev. 126, 949–951.Google Scholar
Hammersley, J. M. (1974) Postulates for subadditive processes. Ann. Prob. 2, 652–680.Google Scholar
Harris, T. E. (1960) A lower bound for the critical probability in a certain percolation process. Math. Proc. Camb. Phil. Soc., 56, 13–20.CrossRefGoogle Scholar
Holley, R. A. and Liggett, T. M. (1975) Ergodic theorems for weakly interacting infinite systems and the voter model. Ann. Prob. 3, 643–663.Google Scholar
Mauldon, J. G. (1961) Asymmetric oriented percolation on a plane. Proc. 4th Berkeley Symp. Math. Statist. 2, 337–345.Google Scholar
Pyatetskii-Shapiro, I. I. and Stavskaya, O. N. (1968) Homogeneous networks of spontaneously active elements (in Russian). Problemy Kybernet. 20, 91–106.Google Scholar
Smythe, R. T. and Wierman, J. C. (1978) First-Passage Percolation on the Square Lattice. Lecture Notes in Mathematics 671, Springer-Verlag, Berlin.Google Scholar