Counting boundary paths for oriented percolation clusters

Random Structures and Algorithms

Volumn 14, Issue 1, 1999, Pages 1-28

  Balister, Paul ^a   Bollobás, Béla ^a   Stacey, Alan ^b  

^a University of Memphis   (United States)

^b PETERHOUSE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033475688     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(1999010)14:1<1::AID-RSA1>3.0.CO;2-J     Document Type: Article

References (23)

1. R. Ahlberg and S. Janson, Upper bounds for the connectivity constant, preprint, Department of Math, Uppsala University, 1981.
2. S. Alm, Upper bounds for the connective constant of self-avoiding walks, Combin Probab Comput 2 (1992), 115-136.
3. P. Balister, B. Bollobás, and A. Stacey, Upper bounds for the critical probability of oriented percolation in two dimensions, Proc Royal Soc London Ser A 440 (1993), 201-220.
4. P. Balister, B. Bollobás, and A. Stacey, Improved upper bounds for the critical probability of oriented percolation in two dimensions, Random Struct Alg 5 (1994), 573-589.
5. W.E. Beyer and M.B. Wells, Lower bound for the connective constant of a self-avoiding walk on a square lattice, J Combin Theory Ser A 13 (1972), 176-182.
6. S.R. Broadbent and J.M. Hammersley, Percolation processes I. Crystals and mazes, Proc Cambridge Phil Soc 53 (1957), 629-641.
7. S.R. Broadbent and J.M. Hammersley, Percolation processes II. The connective constant, Proc Cambridge Phil Soc 53 (1957), 642-645.
8. A.R. Conway, I.G. Enting, and A.J. Guttmann, Algebraic techniques for enumerating self-avoiding walks on the square lattice, J Phys A 26 (1993), 1519-1534.
9. A.R. Conway and A.J. Guttmann, Lower bound on the connective constant for square lattice self-avoiding walks, J Phys A 26 (1993), 3719-3724.
10. R. Durrett, oriented percolation in two dimensions, Ann Probab 12 (1984), 999-1040.
11. M.E. Fisher and M.F. Sykes, Excluded volume problem and the Ising model of ferromagnetism, Phys Rev 114 (1959), 45-58.
12. A.J. Guttman, Bounds on connective constants for self-avoiding walks, J Phys A 16 (1983), 2233-2238.
13. J.M. Hammersley and K.W. Morton, Poor man's Monte Carlo, J Roy Statist Soc Ser B 16 (1954), 23-38.
14. T. Hara and G. Slade, Critical behaviour of self-avoiding walk in five or more dimensions, Bull Amer Math Soc 25 (1991), 417-423.
15. T. Hara and G. Slade, The self-avoiding-walk and percolation critical points in high dimensions, Combin Probab Comput 4 (1995), 197-215.
16. T. Hara, G. Slade, and A.D. Sokal, New lower bounds on the self-avoiding-walk connective constant, J Statist Phys 72 (1993), 479-517.
17. E. Hille, Functional Analysis and Semigroups, American Mathematical Society Colloquium Publications, 31, American Mathematical Society, New York, 1948.
18. T.M. Liggett, Survival of discrete time growth models with applications to oriented percolation, Ann Appl Probab 5 (1995), 613-636.
19. T.M. Liggett, Stochastic models of interacting systems, Ann Probab 25, (1997), 1-29.
20. D.G. Luenberger, Linear and Non-Linear Programming, 2nd ed., Addison-Wesley, Reading, MA, 1984.
21. B. Nienhuis, Exact critical point and critical exponent of O(n) models in two dimensions, Phys Rev Lett 49 (1982), 1062-1065.
22. B.L. van der Waerdan, Algebra Springer-Verlag, Berlin, 1995, Vol. I.
23. A.J. Wakefield, Statistics of the simple cubic lattice II, Proc Cambridge Phil Soc 47 (1951), 799-810.