Counting boundary paths for oriented percolation clusters

Authors

Paul Balister, University of MemphisFollow
Béla Bollobás, University of MemphisFollow
Alan Stacey, Peterhouse

Abstract

We shall use analytic methods to prove bounds on the analogue of the connective constant for the oriented percolation on ℤ2. © 1999 John Wiley & Sons, Inc.

Publication Title

Random Structures and Algorithms

Recommended Citation

Balister, P., Bollobás, B., & Stacey, A. (1999). Counting boundary paths for oriented percolation clusters. Random Structures and Algorithms, 14 (1), 1-28. https://doi.org/10.1002/(SICI)1098-2418(1999010)14:1<1::AID-RSA1>3.0.CO;2-J