Bounding the partition function of spin-systems

MaRDI QIDQ2500991zbMATH OpenFDO

Authors David Galvin

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 $cu{p}_{vinV}lambd{a}_{i,v}:1leqileqmcupcu{p}_{uvinE}lambd{a}_{ij,uv}:1leqileqjleqm$. We consider the probability distribution on $f:Vightarrow1,\mathrm{...},m$ in which each $f$ occurs with probability proportional to $pro{d}_{vinV}lambd{a}_{f(v),v}pro{d}_{uvinE}lambd{a}_{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:Vightarrow1,\mathrm{...},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 $lambd{a}_i:1leqileqmcuplambd{a}_{ij}:1leqileqjleqm$ with each $lambd{a}_{ij}$ either 0 or 1 and with each $f$ chosen with probability proportional to $pro{d}_{vinV}lambd{a}_{f(v)}pro{d}_{uvinE}lambd{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.

Recommendations

• An entropy approach to the hard-core model on bipartite graphs
• Counting in two-spin models on \(d\)-regular graphs
• \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
• A reverse Sidorenko inequality
• Tight bounds on the coefficients of partition functions via stability

Cited in

(12)

• Extremal regular graphs: independent sets and graph homomorphisms
• Counting proper colourings in 4-regular graphs via the Potts model
• Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
• The number of independent sets in an irregular graph
• Partition functions of Polychronakos like spin chains associated with polarized spin reversal operators
• H-coloring tori
• Variational description of bulk energies for bounded and unbounded spin systems
• Improved intolerance intervals and size bounds for a Schelling-type spin system
• A reverse Sidorenko inequality
• Theorems on the Partition Functions of the Heisenberg Ferromagnets
• Rigidity of proper colorings of \(\mathbb{Z}^d \)
• Characterizing partition functions of the spin model by rank growth

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)