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

A fast cluster counting algorithm for percolation on and off lattices

โœ Scribed by E. Stoll

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
343 KB
Volume
109
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

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, where particles are considered to be connected when they are separated by less than a given threshold. For determining the fractal dimensions D, the procedure is very fast in investigating supercells, where replica of smaller boxes with off-lattice structures are arranged.

๐Ÿ“œ SIMILAR VOLUMES

A fast general-purpose clustering algori
A fast general-purpose clustering algorithm based on FPGAs for high-throughput data processing
โœ A. Annovi; M. Beretta ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

We present a fast general-purpose algorithm for high-throughput clustering of data ''with a twodimensional organization''. The algorithm is designed to be implemented with FPGAs or custom electronics. The key feature is a processing time that scales linearly with the amount of data to be processed.