Partition Function Of Potts Model Research Articles

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs

For a graph $G=(V,E)$, $k\in \mathbb{N}$, and a complex number $w$ the partition function of the univariate Potts model is defined as \[ {\bf Z}(G;k,w):=\sum_{\phi:V\to [k]}\prod_{\substack{uv\in E \\ \phi(u)=\phi(v)}}w, \] where $[k]:=\{1,\ldots,k\}$. In this paper we give zero-free regions for the partition function of the anti-ferromagnetic Potts model on bounded degree graphs. In particular we show that for any $\Delta\in \mathbb{N}$ and any $k\geq e\Delta+1$, there exists an open set $U$ in the complex plane that contains the interval $[0,1)$ such that ${\bf Z}(G;k,w)\neq 0$ for any $w\in U$ and any graph $G$ of maximum degree at most $\Delta$. (Here $e$ denotes the base of the natural logarithm.) For small values of $\Delta$ we are able to give better results. As an application of our results we obtain improved bounds on $k$ for the existence of deterministic approximation algorithms for counting the number of proper $k$-colourings of graphs of small maximum degree.

Zeros of the 3-state Potts model partition function for the square lattice revisited**This paper is dedicated to the memory of Vladimir. What PM knows of mentoring he learned from Vladimir, his mentor. Hopefully FZ will become another link in the chain.

We compute the exact partition function for the 3-state Potts model on square lattices of several sizes larger than previously accessible. Making comparison with the exactly solved Ising model we show that, for aspects of the analytic structure close to the ferromagnetic transition point, these lattices are large enough to approach the thermodynamic limit. Subject to certain assumptions this allows for computation of estimates for the specific heat critical exponent. We thus obtain an estimate for this exponent. The estimate is consistent with the known result, thus demonstrating the potential use of this method for other models. We also discuss the antiferromagnetic transition.

G-Tutte Polynomials and Abelian Lie Group Arrangements

AbstractFor a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma $ and an abelian group $G$, we introduce and study an associated $G$-Tutte polynomial, defined by counting the number of homomorphisms from associated finite abelian groups to $G$. The $G$-Tutte polynomial is a common generalization of the (arithmetic) Tutte polynomial for realizable (arithmetic) matroids, the characteristic quasi-polynomial for integral arrangements, Brändén–Moci’s arithmetic version of the partition function of an abelian group-valued Potts model, and the modified Tutte–Krushkal–Renhardy polynomial for a finite CW complex. As in the classical case, $G$-Tutte polynomials carry topological and enumerative information (e.g., the Euler characteristic, point counting, and the Poincaré polynomial) of abelian Lie group arrangements. We also discuss differences between the arithmetic Tutte and the $G$-Tutte polynomials related to the axioms for arithmetic matroids and the (non-)positivity of coefficients.

Tutte Polynomials of Two Self-similar Network Models

The Tutte polynomial T(G; x, y) of a graph G, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in combinatorics and statistical physics. Graph operations have been extensively applied to model complex networks recently. In this paper, we study the Tutte polynomials of the diamond hierarchical lattices and a class of self-similar fractal models which can be constructed through graph operations. Firstly, we find out the behavior of the Tutte polynomial under k-inflation and k-subdivision which are two graph operations. Secondly, we compute and gain the Tutte polynomials of this two self-similar fractal models by using their structure characteristic. Moreover, as an application of the obtained results, some evaluations of their Tutte polynomials are derived, such as the number of spanning trees and the number of spanning forests.

Universality of the mean-field for the Potts model

We consider the Potts model with q colors on a sequence of weighted graphs with adjacency matrices $$A_n$$ , allowing for both positive and negative weights. Under a mild regularity condition on $$A_n$$ we show that the mean-field prediction for the log partition function is asymptotically correct, whenever $${{\mathrm{tr}}}(A_n^2)=o(n)$$ . In particular, our results are applicable for the Ising and the Potts models on any sequence of graphs with average degree going to $$+\infty $$ . Using this, we establish the universality of the limiting log partition function of the ferromagnetic Potts model for a sequence of asymptotically regular graphs, and that of the Ising model for bi-regular bipartite graphs in both ferromagnetic and anti-ferromagnetic domain. We also derive a large deviation principle for the empirical measure of the colors for the Potts model on asymptotically regular graphs.

Tutte Polynomial of Scale-Free Networks

The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both statistical physics and combinatorics. The computation of this invariant for a graph is NP-hard in general. In this paper, we focus on two iteratively growing scale-free networks, which are ubiquitous in real-life systems. Based on their self-similar structures, we mainly obtain recursive formulas for the Tutte polynomials of two scale-free networks (lattices), one is fractal and “large world”, while the other is non-fractal but possess the small-world property. Furthermore, we give some exact analytical expressions of the Tutte polynomial for several special points at (x, y)-plane, such as, the number of spanning trees, the number of acyclic orientations, etc.

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results

Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a phase transition that coincides with the uniqueness phase transition on the infinite D-regular tree. For the ferromagnetic Potts model we investigate whether analogous hardness results hold. Goldberg and Jerrum showed that approximating the partition function of the ferromagnetic Potts model is at least as hard as approximating the number of independent sets in bipartite graphs (#BIS-hardness). We improve this hardness result by establishing it for bipartite graphs of maximum degree D. We first present a detailed picture for the phase diagram for the infinite D-regular tree, giving a refined picture of its first-order phase transition and establishing the critical temperature for the coexistence of the disordered and ordered phases. We then prove for all temperatures below this critical temperature that it is #BIS-hard to approximate the partition function on bipartite graphs of maximum degree D. As a corollary, it is #BIS-hard to approximate the number of k-colorings on bipartite graphs of maximum degree D when k <= D/(2 ln D). The #BIS-hardness result for the ferromagnetic Potts model uses random bipartite regular graphs as a gadget in the reduction. The analysis of these random graphs relies on recent connections between the maxima of the expectation of their partition function, attractive fixpoints of the associated tree recursions, and induced matrix norms. We extend these connections to random regular graphs for all ferromagnetic models and establish the Bethe prediction for every ferromagnetic spin system on random regular graphs. We also prove for the ferromagnetic Potts model that the Swendsen-Wang algorithm is torpidly mixing on random D-regular graphs at the critical temperature for large q.

Zeros of Jones Polynomials of Graphs

In this paper, we introduce the Jones polynomial of a graph $G=(V,E)$ with $k$ components as the following specialization of the Tutte polynomial:$$J_G(t)=(-1)^{|V|-k}t^{|E|-|V|+k}T_G(-t,-t^{-1}).$$We first study its basic properties and determine certain extreme coefficients. Then we prove that $(-\infty, 0]$ is a zero-free interval of Jones polynomials of connected bridgeless graphs while for any small $\epsilon&gt;0$ or large $M&gt;0$, there is a zero of the Jones polynomial of a plane graph in $(0,\epsilon)$, $(1-\epsilon,1)$, $(1,1+\epsilon)$ or $(M,+\infty)$. Let $r(G)$ be the maximum moduli of zeros of $J_G(t)$. By applying Sokal's result on zeros of Potts model partition functions and Lucas's theorem, we prove that\begin{eqnarray*}{q_s-|V|+1\over |E|}\leq r(G)&lt;1+6.907652\Delta_G\end{eqnarray*}for any connected bridgeless and loopless graph $G=(V,E)$ of maximum degree $\Delta_G$ with $q_s$ parallel classes. As a consequence of the upper bound, X.-S. Lin's conjecture holds if the positive checkerboard graph of a connected alternating link has a fixed maximum degree and a sufficiently large number of edges.

Tutte polynomial of the Apollonian network

The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this invariant for a graph is, in general, NP-hard. The aim of this paper is to compute the Tutte polynomial of the Apollonian network. Based on the well-known duality property of the Tutte polynomial, we extend the subgraph-decomposition method. In particular, we do not calculate the Tutte polynomial of the Apollonian network directly, instead we calculate the Tutte polynomial of the Apollonian dual graph. By using the close relation between the Apollonian dual graph and the Hanoi graph, we express the Tutte polynomial of the Apollonian dual graph in terms of that of the Hanoi graph. As an application, we also give the number of spanning trees of the Apollonian network.

The Complexity of Approximately Counting Tree Homomorphisms

We study two computational problems, parameterised by a fixed tree H . #HOMSTO( H ) is the problem of counting homomorphisms from an input graph G to H . #WHOMSTO( H ) is the problem of counting weighted homomorphisms to H , given an input graph G and a weight function for each vertex v of G . Even though H is a tree, these problems turn out to be sufficiently rich to capture all of the known approximation behaviour in # P . We give a complete trichotomy for #WHOMSTO( H ). If H is a star, then #WHOMSTO( H ) is in FP. If H is not a star but it does not contain a certain induced subgraph J 3, then #WHOMSTO( H ) is equivalent under approximation-preserving (AP) reductions to #BIS, the problem of counting independent sets in a bipartite graph. This problem is complete for the class #RHΠ1 under AP-reductions. Finally, if H contains an induced J 3 , then #WHOMSTO( H ) is equivalent under AP-reductions to #SAT, the problem of counting satisfying assignments to a CNF Boolean formula. Thus, #WHOMSTO( H ) is complete for #P under AP-reductions. The results are similar for #HOMSTO( H ) except that a rich structure emerges if H contains an induced J 3 . We show that there are trees H for which #HOMSTO( H ) is # SAT -equivalent (disproving a plausible conjecture of Kelk). However, it is still not known whether #HOMSTO( H ) is #SAT-hard for every tree H which contains an induced J 3. It turns out that there is an interesting connection between these homomorphism-counting problems and the problem of approximating the partition function of the ferromagnetic Potts model . In particular, we show that for a family of graphs Jq , parameterised by a positive integer q , the problem #HOMSTO( Jq ) is AP-interreducible with the problem of approximating the partition function of the q -state Potts model. It was not previously known that the Potts model had a homomorphism-counting interpretation. We use this connection to obtain some additional upper bounds for the approximation complexity of #HOMSTO( Jq ).

ARITHMETIC OF POTTS MODEL HYPERSURFACES

We consider Potts model hypersurfaces defined by the multivariate Tutte polynomial of graphs (Potts model partition function). We focus on the behavior of the number of points over finite fields for these hypersurfaces, in comparison with the graph hypersurfaces of perturbative quantum field theory defined by the Kirchhoff graph polynomial. We give a very simple example of the failure of the "fibration condition" in the dependence of the Grothendieck class on the number of spin states and of the polynomial countability condition for these Potts model hypersurfaces. We then show that a period computation, formally similar to the parametric Feynman integrals of quantum field theory, arises by considering certain thermodynamic averages. One can show that these evaluate to combinations of multiple zeta values for Potts models on polygon polymer chains, while silicate tetrahedral chains provide a candidate for a possible occurrence of non-mixed Tate periods.

Zeros of the Potts model partition function on Sierpinski graphs

We calculate zeros of the $q$-state Potts model partition function on $m$'th-iterate Sierpinski graphs, $S_m$, in the variable $q$ and in a temperature-like variable, $y$. We infer some asymptotic properties of the loci of zeros in the limit $m \to \infty$ and relate these to thermodynamic properties of the $q$-state Potts ferromagnet and antiferromagnet on the Sierpinski gasket fractal, $S_\infty$.

Complex zero-free regions at large [formula omitted] for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights

We find zero-free regions in the complex plane at large |q| for the multivariate Tutte polynomial (also known in statistical mechanics as the Potts-model partition function) ZG(q,w) of a graph G with general complex edge weights w={we}. This generalizes a result of Sokal (2001) [28] that applies only within the complex antiferromagnetic regime |1+we|⩽1. Our proof uses the polymer-gas representation of the multivariate Tutte polynomial together with the Penrose identity.

On the Potts Model Partition Function in an External Field

We study the partition function of the Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it can be expanded in terms of the zero-field partition function. We also show that Z can be written as a sum over the spanning trees, and the spanning forests, of a graph G. Our results extend to Z the well-known spanning tree expansion for the zero-field partition function that arises though its connections with the Tutte polynomial.

Simulating quantum computers with probabilistic methods

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove that sparse quantum circuits as well as circuits composed of CNOT and $\exp[{i\theta X}]$ gates can be simulated classically. In a second part, we apply our results to the simulation of quantum algorithms. It is shown that a recent quantum algorithm, concerned with the estimation of Potts model partition functions, can be simulated efficiently classically. Finally, we show that the exponential speed-ups of Simon's and Shor's algorithms crucially depend on the very last stage in these algorithms, dealing with the classical postprocessing of the measurement outcomes. Specifically, we prove that both algorithms would be classically simulatable if the function classically computed in this step had a sufficiently peaked Fourier spectrum.

The Tutte–Potts connection in the presence of an external magnetic field

The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic fields that appear in most Potts model applications. Here we define the V-polynomial, which lifts the classical relationship between the Tutte polynomial and the zero field Potts model to encompass external magnetic fields. The V-polynomial generalizes Noble and Welshʼs W-polynomial, which extends the Tutte polynomial by incorporating vertex weights and adapting contraction to accommodate them. We prove that the variable field Potts model partition function (with its many specializations) is an evaluation of the V-polynomial, and hence a polynomial with deletion–contraction reduction and Fortuin–Kasteleyn type representation. This unifies an important segment of Potts model theory and brings previously successful combinatorial machinery, including complexity results, to bear on a wider range of statistical mechanics models.

Exact Potts/Tutte polynomials for polygon chain graphs

We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability polynomials are discussed. We also analyze special cases of the Tutte polynomials that determine various quantities of graph-theoretic interest.

Exact Results on Potts Model Partition Functions in a Generalized External Field and Weighted-Set Graph Colorings

We present exact results on the partition function of the $q$-state Potts model on various families of graphs $G$ in a generalized external magnetic field that favors or disfavors spin values in a subset $I_s = \{1,...,s\}$ of the total set of possible spin values, $Z(G,q,s,v,w)$, where $v$ and $w$ are temperature- and field-dependent Boltzmann variables. We remark on differences in thermodynamic behavior between our model with a generalized external magnetic field and the Potts model with a conventional magnetic field that favors or disfavors a single spin value. Exact results are also given for the interesting special case of the zero-temperature Potts antiferromagnet, corresponding to a set-weighted chromatic polynomial $Ph(G,q,s,w)$ that counts the number of colorings of the vertices of $G$ subject to the condition that colors of adjacent vertices are different, with a weighting $w$ that favors or disfavors colors in the interval $I_s$. We derive powerful new upper and lower bounds on $Z(G,q,s,v,w)$ for the ferromagnetic case in terms of zero-field Potts partition functions with certain transformed arguments. We also prove general inequalities for $Z(G,q,s,v,w)$ on different families of tree graphs. As part of our analysis, we elucidate how the field-dependent Potts partition function and weighted-set chromatic polynomial distinguish, respectively, between Tutte-equivalent and chromatically equivalent pairs of graphs.

Computing Tutte Polynomials

The Tutte polynomial of a graph, also known as the partition function of the q -state Potts model is a 2-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. It contains several other polynomial invariants, such as the chromatic polynomial and flow polynomial as partial evaluations, and various numerical invariants such as the number of spanning trees as complete evaluations. However despite its ubiquity, there are no widely available effective computational tools able to compute the Tutte polynomial of a general graph of reasonable size. In this article we describe the implementation of a program that exploits isomorphisms in the computation tree to extend the range of graphs for which it is feasible to compute their Tutte polynomials, and we demonstrate the utility of the program by finding counterexamples to a conjecture of Welsh on the location of the real flow roots of a graph.

A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings

Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of planar graphs. We illustrate it by computing the Potts model partition functions and chromatic polynomials (the number of proper vertex colourings using Q colours) for large samples of random planar graphs with up to N = 100 vertices. In the latter case, our algorithm yields a sub-exponential average running time of , a substantial improvement over the exponential running time ∼exp (0.245N) provided by the hitherto best-known algorithm. We study the statistics of chromatic roots of random planar graphs in some detail, comparing the findings with results for finite pieces of a regular lattice.