2000 character limit reached
Sharp asymptotics of correlation functions in the subcritical long-range random-cluster and Potts models
Published 30 Jun 2020 in math.PR, math-ph, and math.MP | (2007.00116v2)
Abstract: For a family of random-cluster models with cluster weights $q\geq 1$, we prove that the probability that $0$ is connected to $x$ is asymptotically equal to $\tfrac{1}{q}\chi(\beta){2}\beta J_{0,x}$. The method developed in this article can be applied to any spin model for which there exists a random-cluster representation which is one-monotonic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.