DOCSLIB.ORG

Discrete Applied Mathematics the Bivariate Ising Polynomial of a Graph

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Discrete Applied Mathematics the Bivariate Ising Polynomial of a Graph View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 157 (2009) 2515–2524 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The bivariate Ising polynomial of a graph Daniel Andrén, Klas Markström ∗ Department of Mathematics and Mathematical Statistics, Umeå universitet, SE-901 87 Umeå, Sweden article info a b s t r a c t Article history: In this paper we discuss the two variable Ising polynomials in a graph theoretical setting. Received 29 October 2007 This polynomial has its origin in physics as the partition function of the Ising model with Received in revised form 2 December 2008 an external field. We prove some basic properties of the Ising polynomial and demonstrate Accepted 27 February 2009 that it encodes a large amount of combinatorial information about a graph. We also give Available online 28 March 2009 examples which prove that certain properties, such as the chromatic number, are not determined by the Ising polynomial. Finally we prove that there exist large families of non- Keywords: isomorphic planar triangulations with identical Ising polynomial. Graph polynomials Ising polynomial ' 2009 Published by Elsevier B.V. Graph invariants 1. Introduction In graph theory a number of different polynomials associated to a graph have been introduced over the years, and it has repeatedly turned out that they are in fact specialisations of the flagship of this armada of polynomials, the Tutte polynomial. The Tutte polynomial was introduced by Tutte in 1947 [19] after he had observed that a number of interesting graph parameters satisfied similar recursive identities. The Tutte polynomial contains important polynomials such as the chromatic polynomial [12], the Jones polynomial of a knot and the reliability polynomial of a network, see [22] for a survey. In the 1970s it was realised that the Tutte polynomial had an important role to play in statistical physics as well. In 1925 Ising and his thesis advisor Lenz [7] introduced the Ising model for magnetism. In this model a ``spin'' of value ±1 is assigned to every vertex in a graph G. An edge with equal spins at the endpoints is given an energy of 1 and one with unequal endpoints an energy of −1. The total sum of the spin is called the magnetisation. Summing over all such spin assignments we get a generating function Z.G; x; y/, here called the Ising polynomial, where the coefficient of xiyj counts the assignments with energy i and magnetisation j. The Ising model studies how magnetisation and energy are correlated under a suitable probability measure on the set of spin assignments. This model was later extended to the Potts model, which allows more than just two values of the spin. In 1972 Fortuin and Kasteleyn [2] introduced a new representation for the Potts model, where the magnetisation was not included, called the random-cluster model, see [6] for a textbook treatment. It was then realised that the generating function controlling this model is in fact equivalent to the Tutte polynomial. See [18] for a recent survey of the many results connecting the Tutte polynomial and the random-cluster model to various topics in graph theory and physics. For the Ising model we can find the restricted polynomial Z.G; x; 1/ from the Tutte polynomial of G. However, since this polynomial no longer contains the total magnetisation of the spins the random-cluster model does not capture all properties of the original Ising model. There has been many interesting results specifically for the Ising model in the physics literature over the years, such as [8] where it is shown that for a fixed x the zeros of Z.G; x; y/ lie on a circle in the complex plane. However the full Ising polynomial Z.G; x; y/ has not received the same attention in the graph theoretical literature. Our current aim is to demonstrate that the Ising polynomial Z.G; x; y/ is an interesting polynomial from a graph theoretical perspective and study some of its properties. Interestingly we will show that although Z.G; x; 1/ is determined ∗ Corresponding author. Fax: +46 907865222. E-mail address: [email protected] (K. Markström). 0166-218X/$ – see front matter ' 2009 Published by Elsevier B.V. doi:10.1016/j.dam.2009.02.021 2516 D. Andrén, K. Markström / Discrete Applied Mathematics 157 (2009) 2515–2524 by the Tutte polynomial of G the full polynomial Z.G; x; y/ is not, e.g. unlike the Tutte polynomial it is not a trivial function when G is a tree. In the other direction we will also show that the Tutte polynomial is not determined by the Ising polynomial. We thus have a graph polynomial which, although related to, is essentially different from the Tutte polynomial. Just like for the Tutte polynomial there are known graph polynomials which are contained in the Ising polynomial, e.g. the matching polynomial and for regular graphs the independence polynomial. Perhaps the first two members of a new armada. 2. Definitions and relations We will now give the formal definition of the Ising polynomial. In fact we will give two equivalent definitions and demonstrate that the Ising Polynomial is also equivalent to a second polynomial related to eulerian subgraphs of G. The first definition is the original physics definition in terms of ``spin states'' on the vertex set of G and the second is a reformulation of this definition in terms of edge cuts in G. 2.1. The state sum definition We first define a few terms needed for the definition of the Ising polynomial, due to the origin of the Ising polynomial as a physical model for phase transitions in magnetic materials the terminology has a physical flavour. We let G be a simple graph, V .G/ its vertex set, and E.G/ its edge set. We will also use n D jV .G/j and m D jE.G/j. A state σ on G is a function σ V V .G/ ! {−1; 1g, the value of σ at a vertex v is called the magnetisation of v. Definition 2.1. Given a state σ the energy E(σ ; e/ of an edge e D .u; v/ in G is E(σ ; e/ D σ .u)σ .v/, and the energy E(σ /of the state σ is the sum of the energies of the edges, that is X E(σ / D E(σ ; e/: e2E.G/ Definition 2.2. The magnetisation M(σ / of a state σ is the sum of the magnetisations of all the vertices in G, that is, X M(σ / D σ .u/: u2V .G/ Let Ω denote the set of all states on G. We can now define the Ising polynomial: Definition 2.3 (The Ising Polynomial). The Ising polynomial is X E(σ / M(σ / X i j Z.G; x; y/ D x y D ai;jx y : σ2Ω i;j Here we can note two things about Z.G; x; y/. First, Z.G; x; y/ is a Laurent polynomial rather than a polynomial, it can have monomials with negative, but integer, powers. Second, it is also the generating function for the number of states on G with given magnetisation and energy. The following simple lemma will later be useful. Lemma 2.4. The exponents of x in Z.G; x; y/ are at most m, and at least −m. The exponents of y in Z.G; x; y/ are at most n, and at least −n. Another way to look at the state sum definition is to consider a state on G as a graph homomorphism from G to a weighted −1 −1 K2 with loops on both vertices, the vertices have weights y and y , the loops have weight x and the ordinary edge weight x . Recently [3] has shown that a large set of models from statistical mechanics, having a property called reflection positivity, are equivalent to counting weighted graph homomorphisms in this way. In [9] the transfer matrix methods often used for computing partition functions of spin models on lattice graphs were also studied in this general setting. 2.2. Cuts and T -joins A more graph theoretical interpretation of the Ising polynomial can be given in terms of cuts. The values of a state σ defines a bipartition of the graph G such that all the edges with negative energy have one endpoint in each partition. Thus the coefficient ai;j enumerates edge cuts in G such that there are .m − i/=2 edges in the cut and .n − j/=2 vertices in one part of the bipartition. Definition 2.5 (Cut). A cut TS; SNU, or equivalently TSN; SU, where SN D V n S, in a graph G D .V ; E/ is a subset of edges, induced by a partition S [SN D V of the vertices of G, that have one endpoint in S and the other in SN. We let TS; SNU denote the number of edges with exactly one endpoint in S. D. Andrén, K. Markström / Discrete Applied Mathematics 157 (2009) 2515–2524 2517 In this notation we can now give the following equivalent definition of the Ising polynomial Definition 2.6 (The Ising Polynomial). The Ising polynomial is now defined as X n−2i m−2j Z.G; x; y/ D ai;jx y ; i;j where ai;j counts the number of cuts TA; BU of V .G/ such that jAj D j and jTA; BUj D i.
Load more

Recommended publications
  • Arxiv:1504.02898V2 [Cond-Mat.Stat-Mech] 7 Jun 2015 Keywords: Percolation, Explosive Percolation, SLE, Ising Model, Earth Topography
    Recent advances in percolation theory and its applications Abbas Ali Saberi aDepartment of Physics, University of Tehran, P.O. Box 14395-547,Tehran, Iran bSchool of Particles and Accelerators, Institute for Research in Fundamental Sciences (IPM) P.O. Box 19395-5531, Tehran, Iran Abstract Percolation is the simplest fundamental model in statistical mechanics that exhibits phase transitions signaled by the emergence of a giant connected component. Despite its very simple rules, percolation theory has successfully been applied to describe a large variety of natural, technological and social systems. Percolation models serve as important universality classes in critical phenomena characterized by a set of critical exponents which correspond to a rich fractal and scaling structure of their geometric features. We will first outline the basic features of the ordinary model. Over the years a variety of percolation models has been introduced some of which with completely different scaling and universal properties from the original model with either continuous or discontinuous transitions depending on the control parameter, di- mensionality and the type of the underlying rules and networks. We will try to take a glimpse at a number of selective variations including Achlioptas process, half-restricted process and spanning cluster-avoiding process as examples of the so-called explosive per- colation. We will also introduce non-self-averaging percolation and discuss correlated percolation and bootstrap percolation with special emphasis on their recent progress. Directed percolation process will be also discussed as a prototype of systems displaying a nonequilibrium phase transition into an absorbing state. In the past decade, after the invention of stochastic L¨ownerevolution (SLE) by Oded Schramm, two-dimensional (2D) percolation has become a central problem in probability theory leading to the two recent Fields medals.
    [Show full text]
  • Stochastic Analysis: Geometry of Random Processes
    Mathematisches Forschungsinstitut Oberwolfach Report No. 26/2017 DOI: 10.4171/OWR/2017/26 Stochastic Analysis: Geometry of Random Processes Organised by Alice Guionnet, Lyon Martin Hairer, Warwick Gr´egory Miermont, Lyon 28 May – 3 June 2017 Abstract. A common feature shared by many natural objects arising in probability theory is that they tend to be very “rough”, as opposed to the “smooth” objects usually studied in other branches of mathematics. It is however still desirable to understand their geometric properties, be it from a metric, a topological, or a measure-theoretic perspective. In recent years, our understanding of such “random geometries” has seen spectacular advances on a number of fronts. Mathematics Subject Classification (2010): 60xx, 82xx. Introduction by the Organisers The workshop focused on the latest progresses in the study of random geome- tries, with a special emphasis on statistical physics models on regular lattices and random maps, and their connexions with the Gaussian free field and Schramm- Loewner evolutions. The week opened with a spectacular talk by H. Duminil-Copin (based on his work with Raoufi and Tassion), presenting a new, groundbreaking use of decision trees in the context of statistical physics models in order to prove the sharpness of the phase transition, and vastly extending earlier results. Most notably, this new approach allows to circumvent the use of either the BK inequality or of planarity properties. In particular, it applies to the random cluster model FK(d, q) on Zd for every parameter q 1 and dimension d 2. A significant proportion≥ of the talks focused≥ on various and ever growing aspects of discrete random geometries, notably random planar maps, and their links with the planar Gaussian free field (GFF).
    [Show full text]
  • Polynomial Time Randomised Approximation Schemes for the Tutte Polynomial of Dense Graphs
    Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs Noga Alon∗ Alan Friezey Dominic Welshz Abstract (iii) How many acyclic orientations has G? The Tutte-Gr¨othendieck polynomial T (G; x; y) of a graph Each of these is a special case of the general problem of G encodes numerous interesting combinatorial quanti- evaluating the Tutte polynomial of a graph (or matroid) ties associated with the graph. Its evaluation in various at a particular point of the (x; y)-plane | in other words points in the (x; y) plane give the number of spanning is a Tutte-Gr¨othendieck invariant. Other invariants in- forests of the graph, the number of its strongly connected clude: orientations, the number of its proper k-colorings, the (all terminal) reliability probability of the graph, and var- (iv) the chromatic and flow polynomials of a graph; ious other invariants the exact computation of each of which is well known to be #P -hard. Here we develop (v) the partition function of a Q-state Potts model; a general technique that supplies fully polynomial ran- domised approximation schemes for approximating the (vi) the Jones polynomial of an alternating link; value of T (G; x; y) for any dense graph G, that is, any graph on n vertices whose minimum degree is Ω(n), (vii) the weight enumerator of a linear code over GF (q). whenever x 1 and y 1, and in various additional ≥ ≥ points. This region includes evaluations of reliability and It has been shown in Vertigan and Welsh [19] that apart partition functions of the ferromagnetic Q-state Potts from a few special points and 2 special hyperbolae, the model.
    [Show full text]
  • Some Results on the Asymptotic Behavior of Finite Connection Probabilities in Percolation
    NISSUNA UMANA INVESTIGAZIONE SI PUO DIMANDARE VERA SCIENZIA S’ESSA NON PASSA PER LE MATEMATICHE DIMOSTRAZIONI LEONARDO DA VINCI vol. 4 no. 3-4 2016 Mathematics and Mechanics of Complex Systems MASSIMO CAMPANINO AND MICHELE GIANFELICE SOME RESULTS ON THE ASYMPTOTIC BEHAVIOR OF FINITE CONNECTION PROBABILITIES IN PERCOLATION msp MATHEMATICS AND MECHANICS OF COMPLEX SYSTEMS Vol. 4, No. 3-4, 2016 dx.doi.org/10.2140/memocs.2016.4.311 ∩ MM SOME RESULTS ON THE ASYMPTOTIC BEHAVIOR OF FINITE CONNECTION PROBABILITIES IN PERCOLATION MASSIMO CAMPANINO AND MICHELE GIANFELICE We review results of two previous papers on the asymptotic behavior of finite connection probabilities in three or more dimensions for Bernoulli percolation and the Fortuin–Kasteleyn random-cluster model. In the introduction, we prove a multidimensional renewal theorem that is needed for these results and previous results on Ornstein–Zernike behavior; the proof is significantly simpler than that originally derived by Doney (1966) and those of other subsequent works on this subject. 1. Introduction In the last few decades, much progress has been made in the rigorous study of the asymptotic behavior of connection functions in percolation outside the critical point. This problem is related to that of typical fluctuations of clusters and, in two dimensions, of interfaces[Gallavotti 1972; Greenberg and Ioffe 2005]. In the case of the subcritical regime for Bernoulli percolation or the Fortuin– Kasteleyn (FK) random-cluster model on a regular lattice, connection functions, i.e., the probabilities that two points are connected, decay exponentially as the dis- tance between the points tends to infinity [Grimmett 1999; 2006].
    [Show full text]
  • On the Critical Parameters of the Q ≥ 4 Random-Cluster Model on Isoradial Graphs
    On the critical parameters of the q ≥ 4 random-cluster model on isoradial graphs V. Beffara H. Duminil-Copin S. Smirnov Abstract The critical surface for random-cluster model with cluster-weight q ≥ 4 on iso- radial graphs is identified using parafermionic observables. Correlations are also shown to decay exponentially fast in the subcritical regime. While this result is restricted to random-cluster models with q ≥ 4, it extends the recent theorem of [6] to a large class of planar graphs. In particular, the anisotropic random-cluster pvph model on the square lattice are shown to be critical if = q, where pv and (1−pv)(1−ph) ph denote the horizontal and vertical edge-weights respectively. We also provide consequences for Potts models. 1 Introduction 1.1 Motivation Random-cluster models are dependent percolation models introduced by Fortuin and Kasteleyn in 1969 [24]. They have been become an important tool in the study of phase transitions. Among other applications, the spin correlations of Potts models get rephrased as cluster connectivity properties of their random-cluster representations, which allows for the use of geometric techniques, thus leading to several important applications. Nev- ertheless, only few aspects of the random-cluster models are known in full generality. The random-cluster model on a finite connected graph G = (V [G]; E [G]) is a model on edges of this graph, each one being either closed or open. A cluster is a maximal component for the graph composed of all the sites, and of the open edges. The probability of a configuration is proportional to # clusters M pe M (1 − pe) ⋅ q ; e open e closed where the edge-weights pe ∈ [0; 1] (for every e ∈ E [G]) and the cluster-weight q ∈ (0; ∞) are the parameters of the model.
    [Show full text]
  • The Near-Critical Planar FK-Ising Model
    The near-critical planar FK-Ising model Hugo Duminil-Copin Christophe Garban Gábor Pete Abstract We study the near-critical FK-Ising model. First, a determination of the correlation length defined via crossing probabilities is provided. Second, a phenomenon about the near-critical behavior of FK-Ising is highlighted, which is completely missing from the case of standard percolation: in any monotone coupling of FK configurations !p (e.g., in the one introduced in [Gri95]), as one raises p near pc, the new edges arrive in a self-organized way, so that the correlation length is not governed anymore by the number of pivotal edges at criticality. 1 Introduction 2 Phase transition in the random cluster model on Z . The random-cluster model with parameters p [0; 1] and q 1 1 is a probability measure on subgraphs of a finite 2 ≥ graph G = (V; E), defined for all ! E by ⊂ p# open edges(1 p)# closed edgesq# clusters φp;q(!) := − ; Zp;q where Zp;q is the normalization constant such that φp;q is a probability measure. The most classical example of the random-cluster model is bond percolation, which corresponds to the q = 1 case. Even though the random-cluster model can be defined on any graph, 2 we will restrict ourselves to the case of the square lattice Z . Infinite volume measures can be constructed using limits of the above measures along exhaustions by finite subsets (with different boundary conditions: free, wired, etc). Random-cluster models exhibit a 2 phase transition at some critical parameter pc = pc(q).
    [Show full text]
  • THE RANDOM-CLUSTER MODEL Geoffrey Grimmett List of Contents
    THE RANDOM-CLUSTER MODEL Geoffrey Grimmett ×ØÖ The class of random-cluster models is a unification of a variety of sto- chastic processes of significance for probability and statistical physics, including per- colation, Ising, and Potts models; in addition, their study has impact on the theory of certain random combinatorial structures, and of electrical networks. Much (but not all) of the physical theory of Ising/Potts models is best implemented in the context of the random-cluster representation. This systematic summary of random-cluster models includes accounts of the fundamental methods and inequalities, the unique- ness and specification of infinite-volume measures, the existence and nature of the phase transition, and the structure of the subcritical and supercritical phases. The theory for two-dimensional lattices is better developed than for three and more di- mensions. There is a rich collection of open problems, including some of substantial significance for the general area of disordered systems, and these are highlighted when encountered. Amongst the major open questions, there is the problem of ascertaining the exact nature of the phase transition for general values of the cluster-weighting factor q, and the problem of proving that the critical random-cluster model in two dimensions, with 1 ≤ q ≤ 4, converges when re-scaled to a stochastic L¨owner evolu- tion (SLE). Overall the emphasis is upon the random-cluster model for its own sake, rather than upon its applications to Ising and Potts systems. List of contents 1. Introduction 2. Potts and random-cluster measures 2.1 Random-cluster measures 2.2 Ising and Potts models 2.3 Random-cluster and Ising/Potts coupled 2.4 The limit as q ↓ 0 2.5 Rank-generating functions 3.
    [Show full text]
  • THE RANDOM-CLUSTER MODEL Geoffrey
    THE RANDOM-CLUSTER MODEL Geoffrey Grimmett ×ØÖ It is well known that percolation, Ising, and Potts models are special cases of the random-cluster model of Fortuin and Kasteleyn. This paper is an account of the basic properties of this model. Of primary interest is the study of the associated phase transitions. A version of the random-cluster model was discovered by Peter Whittle in his study of the mathematics of polymerization. 1. Introduction The Ising model [30] is a standard mathematical model for ferromagnetism; it exhibits a phase transition and an interesting range of critical phenomena. Whereas the Ising model permits only two possible spins at each site, the Ashkin–Teller and Potts models allow a general number of spin values ([5, 43]). In the late 1960s, Piet Kasteleyn observed that certain observables of electrical networks, percolation processes, and Ising models have features in common, namely versions of the series and parallel laws. In an investigation pursued jointly with Kees Fortuin, he came upon a one-parameter class of measures which includes in its ranks the percolation, Ising, and Potts models, together with (in a certain limit) electrical networks. This class is simple to describe and has rich structure; it is the class of random-cluster models. Unlike its more classical counterparts in statistical physics, the random-cluster model is a process which lives on the edges of a graph rather than on its vertices. It is a random graph whose structure provides information concerning the nature of the phase transition in physical systems. Not only does the model incorporate a unifying description of physical models, but also it provides a natural setting for certain techniques of value ([3, 7, 9, 23, 36, 45]).
    [Show full text]
  • Arxiv:Math.CO/0503607 V1 25 Mar 2005 Ope Variables
    The multivariate Tutte polynomial (alias Potts model) for graphs and matroids Alan D. Sokal Abstract The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more gen- erally on an arbitrary matroid M, and encodes much important combinatorial information about the graph (indeed, in the matroid case it encodes the full structure of the matroid). It contains as a special case the familiar two-variable Tutte polynomial — and therefore also its one-variable specializations such as the chromatic polynomial, the flow polynomial and the reliability polynomial — but is considerably more flexible. I begin by giving an introduction to all these problems, stressing the advantages of working with the multivariate version. I then discuss some questions concerning the complex zeros of the multivariate Tutte polynomial, along with their physical interpretations in statistical me- chanics (in connection with the Yang–Lee approach to phase transitions) and electrical circuit theory. Along the way I mention numerous open problems. This survey is intended to be understandable to mathematicians with no prior knowledge of physics. 1 Introduction Let G = (V, E) be a finite undirected graph with vertex set V and edge set E.1 The multivariate Tutte polynomial of G is, by definition, the polynomial k(A) ZG(q, v) = q ve , (1.1) AX⊆E eY∈A arXiv:math.CO/0503607 v1 25 Mar 2005 where q and v = {ve}e∈E are commuting indeterminates, and k(A) denotes the number of connected components in the subgraph (V, A). [It is sometimes convenient to consider instead −|V | k(A)−|V | ZG(q, v) ≡ q ZG(q, v) = q ve , (1.2) AX⊆E eY∈A e −1 which is a polynomial in q and {ve}.] From a combinatorial point of view, ZG is simply the multivariate generating polynomial that enumerates the spanning sub- graphs of G according to their precise edge content (with weight ve for the edge e) and their number of connected components (with weight q for each component).
    [Show full text]
  • A NOTE on JOINTLY MODELING EDGES and NODE ATTRIBUTES of a NETWORK 2 Levels As a Function of an Underlying Regulatory Network, Or Vise Versa ([22])
    A NOTE ON JOINTLY MODELING EDGES AND NODE ATTRIBUTES OF A NETWORK HAIYAN CAI Abstract. We are interested in modeling networks in which the connectivity among the nodes and node attributes are random variables and interact with each other. We propose a probabilistic model that allows one to formulate jointly a probability distribution for these variables. This model can be described as a combination of a latent space model and a Gaussian graphical model: given the node variables, the edges will follow independent logistic distributions, with the node variables as covariates; given edges, the node variables will be distributed jointly as multivariate Gaussian, with their conditional covariance matrix depending on the graph induced by the edges. We will present some basic properties of this model, including a connection between this model and a dynamical network process involving both edges and node variables, the marginal distribution of the model for edges as a random graph model, its one-edge conditional distributions, the FKG inequality, and the existence of a limiting distribution for the edges in a infinite graph. 1. Introduction In modeling networks ([13, 15, 20]), the usual focus is on the network topologies, or the configurations of edges. A network is typically modeled as a random graph ([3, 6, 8]) defined in terms of a probability distribution of the edge status. However, networks in many applied problems are not always just about links or edges. More extensive data for certain networks, arXiv:1510.01157v2 [math.PR] 6 Sep 2016 containing information not only for edges but also for some node variables or attributes, are becoming available.
    [Show full text]
  • Random Cluster Dynamics for the Ising Model Is Rapidly Mixing
    Random Cluster Dynamics for the Ising model is Rapidly Mixing Heng Guo (Joint work with Mark Jerrum) Durham Jul 29 2017 Queen Mary, University of London 1 The Model The random cluster model (Fortuin, Kasteleyn 69) Parameters 0 6 p 6 1 (edge weight), q > 0 (cluster weight). Given graph G = (V, E), the measure on subgraph r ⊆ E is defined as jrj jEnrj κ(r) πRC(r) / p (1 - p) q , where κ(r) is the number of connected components in (V, r). (1 - p)4q4 p2(1 - p)2q2 p4q 2 The random cluster model (Fortuin, Kasteleyn 69) The partition function (normalizing factor): X jrj jEnrj κ(r) ZRC(p, q) = p (1 - p) q . r⊆E Equivalent to the Tutte polynomial ZTutte(x, y): 1 q = (x - 1)(y - 1) p = 1 - y 3 The random cluster model (Fortuin, Kasteleyn 69) jrj jEnrj κ(r) πRC(r) / p (1 - p) q The motivation is to unify: • Ising model q = 2 • Potts model q > 2, integer • Bond percolation q = 1 (On Kn, Erdős-Rényi random graph) ! ! q ! • Electrical network q 0 (Spanning trees if p 0 and p 0) 4 The random cluster model (Fortuin, Kasteleyn 69) jrj jEnrj κ(r) πRC(r) / p (1 - p) q The motivation is to unify: • Ising model q = 2 • Potts model q > 2, integer • Bond percolation q = 1 (On Kn, Erdős-Rényi random graph) ! ! q ! • Electrical network q 0 (Spanning trees if p 0 and p 0) 4 The random cluster model (Fortuin, Kasteleyn 69) jrj jEnrj κ(r) πRC(r) / p (1 - p) q The motivation is to unify: • Ising model q = 2 • Potts model q > 2, integer • Bond percolation q = 1 (On Kn, Erdős-Rényi random graph) ! ! q ! • Electrical network q 0 (Spanning trees if p 0 and p 0) 4 The random
    [Show full text]
  • The Self-Dual Point of the Two-Dimensional Random-Cluster Model Is Critical For
    The self-dual point of the two-dimensional random-cluster model is critical for q > 1 V. Beffara H. Duminil-Copin May 28, 2018 Abstract We prove a long-standing conjecture on random-cluster models, namely that the critical point for such models with parameter q > 1 on the square lattice is equal to the self-dual point psd(q)= √q/(1 + √q). This gives a proof that the critical temperature of the q-state Potts model is equal to log(1 + √q) for all q > 2. We further prove that the transition is sharp, meaning that there is exponential decay of correlations in the sub-critical phase. The techniques of this paper are rigorous and valid for all q > 1, in contrast to earlier methods valid only for certain given q. The proof extends to the triangular and the hexagonal lattices as well. Introduction Since random-cluster models were introduced by Fortuin and Kasteleyn in 1969 [12], they have become an important tool in the study of phase transitions. The spin correlations of Potts models are rephrased as cluster connectivity properties of their random-cluster representations. This allows the use of geometric techniques, thus leading to several important applications. Nevertheless, only a few aspects of the random-cluster models are understood in full generality. The random-cluster model on a finite connected graph is a model on the edges of the graph, each one being either closed or open. The probability of a configuration is proportional to p# open edges(1 p)# closed edgesq# clusters, − where the edge-weight p [0, 1] and the cluster-weight q (0, ) are the parameters of the ∈ ∈ ∞ model.
    [Show full text]