In: Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 2020, vol. 56, no. 4, p. 2281–2300
We consider a self-avoiding walk model (SAW) on the faces of the square lattice Z2. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square visited by the walk yields a weight that depends on the way the walk passes through it. The local weights are parametrised by angles θ∈[π3,2π3] and satisfy the...
|
In: Annals of Probability, 2020, vol. 48, no. 4, p. 1644–1692
|
In: Probability Theory and Related Fields, 2014, vol. 158, no. 1-2, p. 477-512
|
In: Acta Mathematica Hungarica, 2014, vol. 142, no. 2, p. 366-383
|
In: Algorithmica, 2014, vol. 68, no. 1, p. 265-283
|
In: Transportation, 2014, vol. 41, no. 4, p. 873-888
|
In: Pacific Journal of Mathematics, 2019, vol. 298, no. 2, p. 267–284
|
In: Electronic Journal of Probability, 2018, vol. 23, p. -
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,...
|
In: Electronic Journal of Probability, 2018, vol. 23, p. -
We prove sharpness of the phase transition for the random-cluster model with q≥1 on graphs of the form S:=G×S, where G is a planar lattice with mild symmetry assumptions, and S a finite graph. That is, for any such graph and any q≥1, there exists some parameter pc=pc(S,q), below which the model exhibits exponential decay and above which there exists a.s. an infinite cluster. The result...
|
In: Algorithmica, 2013, vol. 65, no. 1, p. 43-59
|