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. Michael Aizenman and Charles M. Newman. Tree graph inequalities and critical behavior in percolation models. J. Statist. Phys 36(1-2):107-143, 1984. Math. Review 86h:82045
  2. F. Delyon. Taille, forme et nombre des amas dans les problemes de percolation. These de 3eme cycle, Universite Pierre et Marie Curie, Paris, 1980.
  3. A. Telcs. Random walks on graphs, electric networks and fractals. Prob. Th. Rel. Fields 82 (1989), 435-451. Math. Review 90h:60065
  4. S. Flesia, D.S. Gaunt, C.E. Soteros and S.G.Whittington. Statistics of collapsing lattice animals. J. Phys. A 27(17): 5831-5846, 1991. Math. Review unavailable.
  5. Alan Hammond. A lattice animal approach to percolation. J. Phys. A 27(17): 5831-5846, 1991. Math. Review unavailable.
  6. Harry Kesten and Yu Zhang. The probability of a large finite cluster in supercritical Bernoulli percolation. Ann. Probab. 18 (2): 537-555, 1990 . Math. Review unavailable.
  7. Neal Madras. A rigorous bound on the critical exponent for the number of lattice tress, animals, and polygons. J. Statist. Phys. 78(3-4): 681-699, 1995.. Math. Review 95m:82076
Bookmark and Share


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