BRAC University Institutional Repository

A fast tree based cluster labeling algorithm for Monte Carlo simultaitons

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Kamal, Marzuk M.
dc.contributor.author Haque, M. Nasimul
dc.date.accessioned 2010-10-18T06:57:14Z
dc.date.available 2010-10-18T06:57:14Z
dc.date.issued 2005
dc.identifier.uri http://hdl.handle.net/10361/546
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.publisher BRAC University en_US
dc.relation.ispartofseries BRAC University Journal, BRAC University;Vol.2, No.2,pp. 103-106
dc.subject Percolation en_US
dc.subject Cluster labeling algorithm en_US
dc.subject Monte Carlo method en_US
dc.title A fast tree based cluster labeling algorithm for Monte Carlo simultaitons en_US
dc.type Article en_US


Files in this item

Files Size Format View
vol 2 No 2.11 2005.pdf 132.8Kb PDF View/Open or Preview

This item appears in the following Collection(s)

Show simple item record

Policy Guidelines

Search DSpace


Browse

My Account