Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas

DOI10.1007/s10955-014-1054-3zbMath1302.60021arXiv1306.3511OpenAlexW2017048143WikidataQ125024235 ScholiaQ125024235MaRDI QIDQ743431

Rogério Gomes Alves, Aldo Procacci

Publication date: 24 September 2014

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3511

zbMATH Keywords

cluster expansionalgorithmic Lovász local lemmahard core lattice gas

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Moser-Tardos resampling algorithm, entropy compression method and the subset gas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• On a problem of Spencer
• Cluster expansion for abstract polymer models
• A remark on high temperature polymer expansion for lattice systems with infinite range pair interactions
• Polymer gas approach to \(N\)-body lattice systems
• Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights
• Acyclic edge-coloring using entropy compression
• Cluster expansion for abstract polymer models. New bounds from an old approach
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• An Improvement of the Lovász Local Lemma via Cluster Expansion
• An Extension of the Moser--Tardos Algorithmic Local Lemma
• On Dependency Graphs and the Lattice Gas
• A constructive proof of the general lovász local lemma
• An algorithmic approach to the Lovász local lemma. I
• A parallel algorithmic version of the local lemma
• New approach to nonrepetitive sequences
• A constructive proof of the Lovász local lemma
• Moser and tardos meet Lovász

This page was built for publication: Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas