On Dependency Graphs and the Lattice Gas

DOI10.1017/S0963548305007182zbMATH Open1138.05323WikidataQ56893169 ScholiaQ56893169MaRDI QIDQ3373668FDOQ3373668

Alex Scott, Alan D. Sokal

Publication date: 13 March 2006

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

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

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)

Cited In (17)

• 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
• MONOTONE INDEPENDENCE, COMB GRAPHS AND BOSE–EINSTEIN CONDENSATION
• FINITELY DEPENDENT COLORING
• The independence polynomial of rooted products of graphs
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Note on the Smallest Root of the Independence Polynomial
• Bears with hats and independence polynomials
• Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
• Bears with hats and independence polynomials
• Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas
• Long paths and connectivity in 1‐independent random graphs
• The lefthanded local lemma characterizes chordal dependency graphs
• The Ramsey number for 3-uniform tight hypergraph cycles
• An Improvement of the Lovász Local Lemma via Cluster Expansion
• The bivariate Ising polynomial of a graph

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)