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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 2050468 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Epidemics with two levels of mixing
- Self-organized criticality on small world networks
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
Cited in
(13)- Loops of any size and Hamilton cycles in random scale-free networks
- Perturbative quantum field theory on random trees
- Non-self-averaging in autocorrelations for Potts models on quenched random gravity graphs
- Statistical physics on a product of trees
- Random fields on random graphs
- Mean-field lattice trees
- Interaction in agent-based economics: a survey on the network approach
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- Exactly solvable Potts models, bond- and tree-like percolation on dynamical (random) planar lattice
- \(G\) method in action: normalization constant, important probabilities, and fast exact sampling for Potts model on trees
- Tree structures for the current fluctuations in the exclusion process
- Sharp phase transition for the random-cluster and Potts models via decision trees
- On the Potts antiferromagnet on random graphs
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)