2018
DOI: 10.1214/18-ejp223
|View full text |Cite
|
Sign up to set email alerts
|

Universality for the random-cluster model on isoradial graphs

Abstract: We show that the canonical random-cluster measure associated to isoradial graphs is critical for all q 1. Additionally, we prove that the phase transition of the model is of the same type on all isoradial graphs: continuous for 1 q 4 and discontinuous for q > 4. For 1 q 4, the arm exponents (assuming their existence) are shown to be the same for all isoradial graphs. In particular, these properties also hold on the triangular and hexagonal lattices. Our results also include the limiting case of quantum random-… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
44
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 31 publications
(46 citation statements)
references
References 37 publications
2
44
0
Order By: Relevance
“…In this article, the inspiring proof of Ray-Spinka is extended to our context to provide a new proof of 1. We believe that this proof is more transparent and conceptual than the one in [18] and that even though the technique does not directly lead to 2., it illustrates perfectly the interplay between the quantum and classical realms. In fact, a careful analysis of the proofs in the paper of [18] shows that the argument there relies on two pillars: a theorem proving a stronger form of Proposition 1.1 (see also [19,21] for versions on the square lattice), in which 1. of Theorem 1.2 is proved to imply 2., and an argument relying on the Bethe Ansatz showing that 1. indeed occurs.…”
Section: Theorem 12 For All S > 1/2mentioning
confidence: 84%
See 2 more Smart Citations
“…In this article, the inspiring proof of Ray-Spinka is extended to our context to provide a new proof of 1. We believe that this proof is more transparent and conceptual than the one in [18] and that even though the technique does not directly lead to 2., it illustrates perfectly the interplay between the quantum and classical realms. In fact, a careful analysis of the proofs in the paper of [18] shows that the argument there relies on two pillars: a theorem proving a stronger form of Proposition 1.1 (see also [19,21] for versions on the square lattice), in which 1. of Theorem 1.2 is proved to imply 2., and an argument relying on the Bethe Ansatz showing that 1. indeed occurs.…”
Section: Theorem 12 For All S > 1/2mentioning
confidence: 84%
“…In fact, a careful analysis of the proofs in the paper of [18] shows that the argument there relies on two pillars: a theorem proving a stronger form of Proposition 1.1 (see also [19,21] for versions on the square lattice), in which 1. of Theorem 1.2 is proved to imply 2., and an argument relying on the Bethe Ansatz showing that 1. indeed occurs. The adaptation of the Ray-Spinka argument enables us to prove 1. directly without using the Bethe Ansatz, so that the argument in this paper replaces half of the argument in [18], and that combined with the other half it also implies 2.…”
Section: Theorem 12 For All S > 1/2mentioning
confidence: 99%
See 1 more Smart Citation
“…• On the topic of locality of observables for critical Z-invariant models, let us also mention the paper [25] by Manolescu and Grimmett, recently extended to the random cluster model [22]. Amongst other results, the authors prove the universality of typical critical exponents and Russo-Seymour-Welsh type estimates.…”
Section: Introductionmentioning
confidence: 98%
“…3), and the goal is to define Boltzmann weights in terms of θ so as to transform these relations into the Yang-Baxter equations. Several Z -invariant models have been studied on lozenge graphs, including the bipartite dimer model [45], Ising model [13,16], Laplacian (or spanning forest model) [14,45], random cluster model [28]. The results of [49] also imply that we do not lose anything by considering the Yang-Baxter equations on a lozenge graph rather than on a pseudoline arrangement, like that of [5].…”
Section: Theoremmentioning
confidence: 99%