Bounding the partition function of spin-systems

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.3200, https://eudml.org/doc/126584, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r72.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph homomorphisms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: With a graph

G = (V, E)

we associate a collection of non-negative real weights

c u p_{v i n V} l a m b d a_{i, v} : 1 l e q i l e q m c u p c u p_{u v i n E} l a m b d a_{i j, u v} : 1 l e q i l e q j l e q m

. We consider the probability distribution on

f : V i g h t a r r o w 1, ..., m

in which each

f

occurs with probability proportional to

p r o d_{v i n V} l a m b d a_{f (v), v} p r o d_{u v i n E} l a m b d a_{f (u) f (v), u v}

. Many well-known statistical physics models, including the Ising model with an external field and the hard-core model with non-uniform activities, can be framed as such a distribution. We obtain an upper bound, independent of

G

, for the partition function (the normalizing constant which turns the assignment of weights on

f : V i g h t a r r o w 1, ..., m

into a probability distribution) in the case when

G

is a regular bipartite graph. This generalizes a bound obtained by Galvin and Tetali who considered the simpler weight collection

l a m b d a_{i} : 1 l e q i l e q m c u p l a m b d a_{i j} : 1 l e q i l e q j l e q m

with each

l a m b d a_{i j}

either 0 or 1 and with each

f

chosen with probability proportional to

p r o d_{v i n V} l a m b d a_{f (v)} p r o d_{u v i n E} l a m b d a_{f (u) f (v)}

. Our main tools are a generalization to list homomorphisms of a result of Galvin and Tetali on graph homomorphisms and a straightforward second-moment computation.

Review text

Summary: With a graph \(G=(V,E)\) we associate a collection of non-negative real weights \[ \bigcup_{v\in V}\{\lambda_{i,v}:1\leq i \leq m\} \cup \bigcup_{uv \in E} \{\lambda_{ij,uv}:1\leq i \leq j \leq m\}. \] We consider the probability distribution on \(\{f:V\rightarrow\{1,\dots,m\}\}\) in which each \(f\) occurs with probability proportional to \[ \prod_{v \in V}\lambda_{f(v),v}\prod_{uv \in E}\lambda_{f(u)f(v),uv}. \] Many well-known statistical physics models, including the Ising model with an external field and the hard-core model with non-uniform activities, can be framed as such a distribution. We obtain an upper bound, independent of \(G\), for the partition function (the normalizing constant which turns the assignment of weights on \(\{f:V\rightarrow\{1,\dots,m\}\}\) into a probability distribution) in the case when \(G\) is a regular bipartite graph. This generalizes a bound obtained by \textit{D. Galvin} and \textit{P. Tetali} [DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 63, 97--104 (2004; Zbl 1061.05068)] who considered the simpler weight collection \[ \{\lambda_i:1 \leq i \leq m\} \cup \{\lambda_{ij}:1 \leq i \leq j \leq m\} \] with each \(\lambda_{ij}\) either \(0\) or \(1\) and with each \(f\) chosen with probability proportional to \[ \prod_{v \in V}\lambda_{f(v)}\prod_{uv \in E}\lambda_{f(u)f(v)}. \] Our main tools are a generalization to list homomorphisms of a result of D. Galvin and P. Tetali on graph homomorphisms and a straightforward second-moment computation.

Recommendations

Cited in

(13)

This page was built for publication: Bounding the partition function of spin-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500991)