2019
DOI: 10.1007/978-3-030-32011-9_2
|View full text |Cite
|
Sign up to set email alerts
|

Lectures on the Ising and Potts Models on the Hypercubic Lattice

Abstract: Phase transitions are a central theme of statistical mechanics, and of probability more generally. Lattice spin models represent a general paradigm for phase transitions in finite dimensions, describing ferromagnets and even some fluids (lattice gases). It has been understood since the 1980s that random geometric representations, such as the random walk and random current representations, are powerful tools to understand spin models. In addition to techniques intrinsic to spin models, such representations prov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
77
0
3

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 58 publications
(82 citation statements)
references
References 133 publications
2
77
0
3
Order By: Relevance
“…. , x 2n } as, under this assumption, the expression (1.8) and the bound (1.14) yield 15) which is the claimed statement. Two different, but not unrelated, mechanisms may make the probability of avoided intersections (for sets of widely separated source points) small for the Ising model at its critical point.…”
Section: Proof Idea Of Theorem 12supporting
confidence: 57%
“…. , x 2n } as, under this assumption, the expression (1.8) and the bound (1.14) yield 15) which is the claimed statement. Two different, but not unrelated, mechanisms may make the probability of avoided intersections (for sets of widely separated source points) small for the Ising model at its critical point.…”
Section: Proof Idea Of Theorem 12supporting
confidence: 57%
“…The generalization of Theorem 3.3 requires the development of a new RSW theory enabled to tackle percolation models with dependency. This theory led to a number of new applications on these models, including a precise description of the critical behavior (see [20,14,11] and [12,13] for reviews). We chose not to discuss this here, and focus on the generalizations of Theorems 2.2 and 2.5.…”
Section: Computation Of the Critical Point For Random-cluster Models mentioning
confidence: 99%
“…The original proof of the OSSS inequality, see [20] or [6] for more probabilistic version, uses the product structure of the space considered (the Bernoulli percolation model). But P z,β Λ,ω Λ c is not a product measure and we need a more elaborate method.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…This is done using the OSSS inequality (4.7) to the wired measure µ z n for the Boolean function f (ω) = 1 0←→ r ∂Λn (ω) to the well chosen algorithms from [7,8]. This proposition uses the now standard algorithms used in [6,7,9]. The proof of Proposition 4.2 is done in the Annex Section 6.…”
Section: Proof Of Theoremmentioning
confidence: 99%