Potts model on random trees

From MaRDI portal
Publication:4968831




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.









This page was built for publication: Potts model on random trees

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