Potts Model On Random Trees

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.

10 pages, 3 figures

References in corpus (3)

• The structure and function of complex networks
• Co-evolutionary games on networks
• Potts model on complex networks

Cited by in corpus (3)

• Critical phenomena in complex networks
• Phenomenological Models of Socio-Economic Network Dynamics
• Loops of any size and Hamilton cycles in random scale-free networks