A fast tree based cluster labeling algorithm for Monte Carlo simultaitons
A highly efficient tree based algorithm for studying site or bond percolation on any lattice system is described. Our approach is to identify the connectivity of the lattice sites in a single phase and to reduce the redundant computational load in each lattice update. Efficiency increases due to the...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
BRAC University
2010
|
| Ämnen: | |
| Länkar: | http://hdl.handle.net/10361/546 |