On Dependency Graphs and the Lattice Gas

DOI10.1017/S0963548305007182MaRDI QIDQ3373668zbMATH OpenWikidataFDO

Authors Alex Scott, Alan D. Sokal

Publication date 13 March 2006

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

Full work available at URL https://doi.org/10.1017/S0963548305007182

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Weighted dependency graphs and the Ising model
• Gibbs measures and phase transitions on sparse random graphs
• On a non-equilibrium statistical mechanics of graph homomorphisms
• scientific article; zbMATH DE number 4047060
• Graph bipartitioning and statistical mechanics
• A little statistical mechanics for the graph theorist
• A Potts/Ising correspondence on thin graphs
• The integrated density of states of the random graph Laplacian
• Equilibrium statistical mechanics on correlated random graphs
• The Laplacian energy of random graphs

Cited in

(22)

• An estimate for the probability of dependent events
• One-dependent colorings of the star graph
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma
• MONOTONE INDEPENDENCE, COMB GRAPHS AND BOSE–EINSTEIN CONDENSATION
• Central limit theorems and the geometry of polynomials
• The independence polynomial of rooted products of graphs
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Long paths and connectivity in 1-independent random graphs
• Shearer's measure and stochastic domination of product measures
• Bears with hats and independence polynomials
• Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
• Quest for negative dependency graphs
• Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas
• Variable version Lovász local lemma: a tale of two boundaries
• An improvement of the Lovász local lemma via cluster expansion
• Bears with hats and independence polynomials
• The lefthanded local lemma characterizes chordal dependency graphs
• The Ramsey number for 3-uniform tight hypergraph cycles
• Note on the smallest root of the independence polynomial
• The bivariate Ising polynomial of a graph
• Finitely dependent coloring

This page was built for publication: On Dependency Graphs and the Lattice Gas

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