Potts Model On Random Trees

Preprint

9 November 2004

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0411226

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.

Keywords

DEGREE DISTRIBUTION
POPULATION DYNAMICS
UNIFORM LOCAL
LOCALLY TREE
RANDOM TREES
POTTS MODEL
LIKE RANDOM
ALGORITHM
TREE

All Related Versions

Version 1, 2004-11-09, ArXiv
Published version: Journal of Statistical Mechanics: Theory and Experiment, 2005 (02), P02006.

This publication has 0 references indexed in Scilit: