Potts Model On Random Trees
Statistical Mechanics
2009-11-10 v1
Abstract
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a previous approach are made, showing where its assumption of uniform local fields breaks down for networks with nodes of low degree.
Cite
@article{arxiv.cond-mat/0411226,
title = {Potts Model On Random Trees},
author = {G. C. M. A. Ehrhardt and M. Marsili},
journal= {arXiv preprint arXiv:cond-mat/0411226},
year = {2009}
}
Comments
10 pages, 3 figures