About two cluster generating algorithms

DOI10.1016/J.JCP.2005.01.001MaRDI QIDQ556301zbMATH OpenOpenAlexFDO

Authors Gelu M. Nita

Publication date 13 June 2005

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcp.2005.01.001

zbMATH Keywords

Cluster configurationsIsing model

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Cluster algorithm for hard spheres and related systems
• Counting lattice animals: A parallel attack
• Hybrid cluster identification
• MONTE CARLO SIMULATIONS OF MOLECULAR CLUSTERS: FROM SCALAR TO PARALLEL
• A genetic algorithm for Lennard-Jones atomic clusters

Cites work

• On the lowest energy nucleation path in a supersaturated lattice gas

Cited in

(7)

• A fast cluster counting algorithm for percolation on and off lattices
• Simulated annealing clusterization algorithm for studying the multifragmentation
• Cluster algorithm for hard spheres and related systems
• Measurement of atomic clusters integral characteristics in computer simulation
• Cluster algorithms for discrete models of colloids with bars
• Hybrid cluster identification
• Two-size probability-changing cluster algorithm

This page was built for publication: About two cluster generating algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556301)