๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A cluster detection algorithm based on percolation theory

โœ Scribed by Craig Gotsman

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
240 KB
Volume
12
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Annihilation on a percolation cluster
Annihilation on a percolation cluster
โœ A.G. Vitukhnovsky; B.L. Pyttel; I.M. Sokolov ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB
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,