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...
| Главные авторы: | Kamal, Marzuk M., Haque, M. Nasimul |
|---|---|
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
BRAC University
2010
|
| Предметы: | |
| Online-ссылка: | http://hdl.handle.net/10361/546 |
Схожие документы
-
Sequential Monte Carlo methods in practice /
Опубликовано: (2001) -
Quantum monte carlo methods in condensed matter physics /
Опубликовано: (1993) -
Analysis of uncertainty in different neural network structures using Monte Carlo Dropout
по: Islam, Md. Farhadul, и др.
Опубликовано: (2024) -
Analysis of uncertainty in different neural network structures using monte carlo dropout
по: Islam, Md. Farhadul, и др.
Опубликовано: (2024) -
Efficient approach for reliability evaluation of distribution system considering momentary interruption
по: Ahmed, Tanjil, и др.
Опубликовано: (2021)