Percolation on the average and spontaneous magnetization forq-states Potts model on graph
From MaRDI portal
Publication:4470670
Abstract: We prove that the q-states Potts model on graph is spontaneously magnetized at finite temperature if and only if the graph presents percolation on the average. Percolation on the average is a combinatorial problem defined by averaging over all the sites of the graph the probability of belonging to a cluster of a given size. In the paper we obtain an inequality between this average probability and the average magnetization, which is a typical extensive function describing the thermodynamic behaviour of the model.
Recommendations
- Percolation and ferromagnetism on \(\mathbb Z^ 2\): the \(q\)-state Potts cases
- Percolation and magnetization for generalized continuous spin models
- Percolation in the random cluster process and Q-state Potts model
- On the Potts antiferromagnet on random graphs
- Percolation and phase transitions in a class of random spin systems
- Ising and Potts models on quenched random gravity graphs.
- A percolation-theoretic approach to spin glass phase transitions
- Metastability of the Potts ferromagnet on random regular graphs
- Percolation and Gibbs states multiplicity for ferromagnetic Ashkin-Teller models on
Cited in
(3)
This page was built for publication: Percolation on the average and spontaneous magnetization forq-states Potts model on graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470670)
