Cluster algorithms and computational complexity
Cluster algorithms for the 2D Ising model with a staggered field have been studied and a new cluster algorithm for path sampling has been worked out. The complexity properties of Bak-Seppen model and the Growing network model have been studied by using the Computational Complexity Theory. The dynami...
Main Author: | Li, Xuenan |
---|---|
Language: | ENG |
Published: |
ScholarWorks@UMass Amherst
2002
|
Subjects: | |
Online Access: | https://scholarworks.umass.edu/dissertations/AAI3068577 |
Similar Items
-
The invaded cluster algorithm
by: Choi, Yongsoo
Published: (1997) -
Cluster Monte Carlo and network flow algorithms for critical phenomena
by: Dukovski, Ilija
Published: (2001) -
Parallel computational complexity in statistical physics
by: Moriarty, Kenneth J
Published: (1998) -
Computational studies of classical disordered spin systems
by: Wu, Yong
Published: (2006) -
Phase diagrams of stoichiometric polyelectrolyte-surfactant complexes
by: Leonard, Michael J
Published: (2005)