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...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Kamal, Marzuk M., Haque, M. Nasimul
Format:	Artykuł
Język:	English
Wydane:	BRAC University 2010
Hasła przedmiotowe:	Percolation Cluster labeling algorithm Monte Carlo method
Dostęp online:	http://hdl.handle.net/10361/546

id	10361-546
record_format	dspace
spelling	10361-5462019-09-29T05:46:28Z A fast tree based cluster labeling algorithm for Monte Carlo simultaitons Kamal, Marzuk M. Haque, M. Nasimul Percolation Cluster labeling algorithm Monte Carlo method 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. 2010-10-18T06:57:14Z 2010-10-18T06:57:14Z 2005 Article http://hdl.handle.net/10361/546 en BRAC University Journal, BRAC University;Vol.2, No.2,pp. 103-106 application/pdf BRAC University
institution	Brac University
collection	Institutional Repository
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
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
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	2010
url	http://hdl.handle.net/10361/546
work_keys_str_mv	AT kamalmarzukm afasttreebasedclusterlabelingalgorithmformontecarlosimultaitons AT haquemnasimul afasttreebasedclusterlabelingalgorithmformontecarlosimultaitons AT kamalmarzukm fasttreebasedclusterlabelingalgorithmformontecarlosimultaitons AT haquemnasimul fasttreebasedclusterlabelingalgorithmformontecarlosimultaitons
_version_	1814308109076660224

A fast tree based cluster labeling algorithm for Monte Carlo simultaitons

Podobne zapisy