Premium
Counting Boundary Paths for Oriented Percolation Clusters
Author(s) -
Balister Paul,
Bollobás Béla,
Stacey Alan
Publication year - 1999
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/(sici)1098-2418(1999010)14:1<1::aid-rsa1>3.0.co;2-j
Subject(s) - struct , percolation (cognitive psychology) , boundary (topology) , constant (computer programming) , mathematics , statistical physics , combinatorics , discrete mathematics , computer science , physics , mathematical analysis , psychology , programming language , neuroscience
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. Random Struct. Alg., 14, 1–28, 1999