Schramm's locality conjecture for random-cluster models

From papers

Let q>0q>0 and let (Gn)(\mathbb{G}_n) be a sequence of infinite transitive graphs converging locally to an infinite transitive graph G\mathbb{G}. For an infinite transitive graph H\mathbb{H}, write pc(H,q)p_c(\mathbb{H},q) for the infimum of the edge-weight parameters p[0,1]p\in[0,1] such that the random-cluster measure ϕH,p,q1\phi_{\mathbb{H},p,q}^1 assigns positive probability to the event that the origin is connected to infinity. Schramm's conjecture. If pc(Gn,q)<1p_c(\mathbb{G}_n,q)<1 for all nn, then

limnpc(Gn,q)=pc(G,q).\lim_{n\rightarrow\infty}p_c(\mathbb{G}_n,q)=p_c(\mathbb{G},q).

This conjecture asserts locality of the critical point for random-cluster models under local convergence of transitive graphs. The supplied text does not state a resolution, so its status remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Hugo Duminil-Copin and Vincent Tassion, “A note on Schramm's locality conjecture for random-cluster models”, arXiv:1707.07626 (2017).

Solutions 0

No solutions have been posted yet.