Sharp phase transition for the random-cluster and Potts models via decision trees (Q1711490): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:24, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sharp phase transition for the random-cluster and Potts models via decision trees |
scientific article |
Statements
Sharp phase transition for the random-cluster and Potts models via decision trees (English)
0 references
18 January 2019
0 references
This paper introduces a strong new tool, the (generalised) OSSS inequality for decision trees, which originated in computer science, into the study of statistical mechanical lattice models with a Fortuin-Kasteleyn random-cluster representation. Inequalities for Boolean functions have been made useful in statistical mechanics before, but the present one clearly improves on earlier existing proofs and results. As a consequence, various existing results are generalised, provided with shorter proofs, or both. In particular, the high-temperature phase (subcritical percolation phase) displays exponential decay down to the critical point; there holds a mean-field bound on some critical exponents, and for graphs which satisfy a duality relation, there is a relation between their percolation threshold. The strength of these results is in their generality, for planar graphs and for percolation or Ising models most of these results were known, but the authors here can in one go handle general finite-range ferromagnets, including Potts spins, on general graphs (and in general dimensions). Since the paper appeared, the results have already been extended for further models, e.g., Gaussian fields and loop \(O(n)\) models. It promises to be a classic paper in my opinion.
0 references
Percolation, Potts model, sharp transition, exponential decay, randomized algorithm, OSSS inequality
0 references