Physics – Condensed Matter – Statistical Mechanics
Scientific paper
1997-11-27
Intern. J. Modern Phys. C, v.9(1) (1998) 43.
Physics
Condensed Matter
Statistical Mechanics
LaTeX, uses ijmpc1.sty(included), 18 pages, 3 figures, submitted to Intern. J. of Modern Physics C
Scientific paper
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman multiple labeling technique for cluster statistics is redescribed. Modifications for random and aperiodic lattices are sketched as well as some parallelised versions of the algorithm are mentioned. The graph-theoretical basis for the spanning tree approaches is given by describing the "breadth-first search" and "depth-first search" procedures. Examples are given for extracting the elastic and geometric "backbone" of a percolation cluster. An implementation of the "pebble game" algorithm using a depth-first search method is also described.
No associations
LandOfFree
Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-142824