𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting Boundary Paths for Oriented Percolation Clusters

✍ Scribed by Paul Balister; Béla Bollobás; Alan Stacey

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
301 KB
Volume
14
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

We shall use analytic methods to prove bounds on the analogue of the connective constant for the oriented percolation on ‫ޚ‬ 2 .

📜 SIMILAR VOLUMES

A fast cluster counting algorithm for pe
A fast cluster counting algorithm for percolation on and off lattices
✍ E. Stoll 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behavior of the largest cluster and for calculating the fractai dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems,