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...
Main Authors: | , |
---|---|
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
BRAC University
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/10361/546 |
id |
ftbracuniv:oai:localhost:10361/546 |
---|---|
record_format |
openpolar |
spelling |
ftbracuniv:oai:localhost:10361/546 2023-05-15T18:32:39+02:00 A fast tree based cluster labeling algorithm for Monte Carlo simultaitons Kamal, Marzuk M. Haque, M. Nasimul 2005 http://hdl.handle.net/10361/546 en eng BRAC University BRAC University Journal, BRAC University;Vol.2, No.2,pp. 103-106 http://hdl.handle.net/10361/546 Percolation Cluster labeling algorithm Monte Carlo method Article 2005 ftbracuniv 2016-04-04T15:19:09Z 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 creation of a multi-branched tree of the pointers of the cluster numbers at the time of investigation of cluster organization. At the later updates, the computational efficiency increases further as the algorithm would have to work only on the randomly chosen lattice sites or bonds instead of traversing the entire lattice. Article in Journal/Newspaper The Pointers BRAC University, Bangladesh: Institutional Repository |
institution |
Open Polar |
collection |
BRAC University, Bangladesh: Institutional Repository |
op_collection_id |
ftbracuniv |
language |
English |
topic |
Percolation Cluster labeling algorithm Monte Carlo method |
spellingShingle |
Percolation Cluster labeling algorithm Monte Carlo method Kamal, Marzuk M. Haque, M. Nasimul A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
topic_facet |
Percolation Cluster labeling algorithm Monte Carlo method |
description |
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 creation of a multi-branched tree of the pointers of the cluster numbers at the time of investigation of cluster organization. At the later updates, the computational efficiency increases further as the algorithm would have to work only on the randomly chosen lattice sites or bonds instead of traversing the entire lattice. |
format |
Article in Journal/Newspaper |
author |
Kamal, Marzuk M. Haque, M. Nasimul |
author_facet |
Kamal, Marzuk M. Haque, M. Nasimul |
author_sort |
Kamal, Marzuk M. |
title |
A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
title_short |
A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
title_full |
A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
title_fullStr |
A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
title_full_unstemmed |
A fast tree based cluster labeling algorithm for Monte Carlo simultaitons |
title_sort |
fast tree based cluster labeling algorithm for monte carlo simultaitons |
publisher |
BRAC University |
publishDate |
2005 |
url |
http://hdl.handle.net/10361/546 |
genre |
The Pointers |
genre_facet |
The Pointers |
op_relation |
BRAC University Journal, BRAC University;Vol.2, No.2,pp. 103-106 http://hdl.handle.net/10361/546 |
_version_ |
1766216851211157504 |