The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. Benjamini, I. and Kesten, H. (1995), Percolation of arbitrary words in {0,1}N. Ann. Probab. 23, 1024-1060. Math. Review 97a:60140
  2. van den Berg, J. and Ermakov, A. (1996), A new lower bound for the critical probability of site percolation on the square lattice. Random Structures and Algorithms 8, 199-212. Math. Review 99b:60165
  3. Grimmett, G. R. (1999), Percolation. 2nd ed., Springer Verlag, Berlin. Math. Review 2001a:60114
  4. Harris, T. E. (1960), A lower bound for the critical probability in a certain percolation process. Proc. Cambr. Phil. Soc. 56, 13-20. Math. Review 22:6023
  5. Kesten, H. (1982), Percolation Theory for Mathematicians. Birkhauser-Boston. Math. Review 84i:60145
  6. Kesten, H., Sidoravicius, V. and Zhang, Y. (1998), Almost all words are seen in critical site percolation on the triangular lattice. Elec. J. Probab. 3, 1-75. Math. Review 94a:60134
  7. Newman, M. H. A. (1951), Elements of the Topology of Plane Sets of Points. 2nd ed., Cambr. Univ. Press. Math. Review 82i:60182
  8. Smythe, R. T. and Wierman, J. C. (1978), Percolation on the Square Lattice. Lecture Notes in Mathematics, vol 671, Springer-Verlag. Math. Review 80a:60135
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.