On Dependency Graphs and the Lattice Gas

DOI10.1017/S0963548305007182zbMath1138.05323WikidataQ56893169 ScholiaQ56893169MaRDI QIDQ3373668

Alexander D. Scott, Alan D. Sokal

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

Note on the Smallest Root of the Independence Polynomial, One-dependent colorings of the star graph, Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs, Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas, An estimate for the probability of dependent events, The bivariate Ising polynomial of a graph, The independence polynomial of rooted products of graphs, Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts, Bears with hats and independence polynomials, FINITELY DEPENDENT COLORING, An Improvement of the Lovász Local Lemma via Cluster Expansion, The lefthanded local lemma characterizes chordal dependency graphs, Long paths and connectivity in 1‐independent random graphs, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles