16,734 research outputs found
Efficiency of the Incomplete Enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
We study the efficiency of the incomplete enumeration algorithm for linear
and branched polymers. There is a qualitative difference in the efficiency in
these two cases. The average time to generate an independent sample of
sites for large varies as for linear polymers, but as for branched (undirected and directed) polymers, where
. On the binary tree, our numerical studies for of order
gives . We argue that exactly in this
case.Comment: replaced with published versio
- …