On dependency graphs and the lattice gas

Alexander D. Scott, Alan D. Sokal

    Research output: Contribution to journalArticle

    Abstract

    We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász Local Lemma in probabilistic combinatorics. We show that the conclusion of the Lovász Local Lemma holds for dependency graph $G$ and probabilities {p x} if and only if the independent-set polynomial for $G$ is nonvanishing in the polydisc of radii {p x}. Furthermore, we show that the usual proof of the Lovász Local Lemma - which provides a sufficient condition for this to occur - corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer [28] and explicitly by Dobrushin [12, 13]. We also present a generalization of the Lovász Local Lemma that allows for 'soft' dependencies. The paper aims to provide an accessible discussion of these results, which are drawn from a longer paper [26] that has appeared elsewhere.

    Original languageEnglish (US)
    Pages (from-to)253-279
    Number of pages27
    JournalCombinatorics Probability and Computing
    Volume15
    Issue number1-2
    DOIs
    StatePublished - Jan 2006

    Fingerprint

    Dependency Graph
    Lattice Gas
    Lemma
    Polynomials
    Polydisk
    Statistical mechanics
    Independent Set
    Gases
    Polynomial
    Combinatorics
    Statistical Mechanics
    Radius
    If and only if
    Sufficient Conditions

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computational Theory and Mathematics
    • Mathematics(all)
    • Discrete Mathematics and Combinatorics
    • Statistics and Probability

    Cite this

    On dependency graphs and the lattice gas. / Scott, Alexander D.; Sokal, Alan D.

    In: Combinatorics Probability and Computing, Vol. 15, No. 1-2, 01.2006, p. 253-279.

    Research output: Contribution to journalArticle

    Scott, Alexander D. ; Sokal, Alan D. / On dependency graphs and the lattice gas. In: Combinatorics Probability and Computing. 2006 ; Vol. 15, No. 1-2. pp. 253-279.
    @article{d43d92a47ae54b2a9c06d1212785150f,
    title = "On dependency graphs and the lattice gas",
    abstract = "We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lov{\'a}sz Local Lemma in probabilistic combinatorics. We show that the conclusion of the Lov{\'a}sz Local Lemma holds for dependency graph $G$ and probabilities {p x} if and only if the independent-set polynomial for $G$ is nonvanishing in the polydisc of radii {p x}. Furthermore, we show that the usual proof of the Lov{\'a}sz Local Lemma - which provides a sufficient condition for this to occur - corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer [28] and explicitly by Dobrushin [12, 13]. We also present a generalization of the Lov{\'a}sz Local Lemma that allows for 'soft' dependencies. The paper aims to provide an accessible discussion of these results, which are drawn from a longer paper [26] that has appeared elsewhere.",
    author = "Scott, {Alexander D.} and Sokal, {Alan D.}",
    year = "2006",
    month = "1",
    doi = "10.1017/S0963548305007182",
    language = "English (US)",
    volume = "15",
    pages = "253--279",
    journal = "Combinatorics Probability and Computing",
    issn = "0963-5483",
    publisher = "Cambridge University Press",
    number = "1-2",

    }

    TY - JOUR

    T1 - On dependency graphs and the lattice gas

    AU - Scott, Alexander D.

    AU - Sokal, Alan D.

    PY - 2006/1

    Y1 - 2006/1

    N2 - We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász Local Lemma in probabilistic combinatorics. We show that the conclusion of the Lovász Local Lemma holds for dependency graph $G$ and probabilities {p x} if and only if the independent-set polynomial for $G$ is nonvanishing in the polydisc of radii {p x}. Furthermore, we show that the usual proof of the Lovász Local Lemma - which provides a sufficient condition for this to occur - corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer [28] and explicitly by Dobrushin [12, 13]. We also present a generalization of the Lovász Local Lemma that allows for 'soft' dependencies. The paper aims to provide an accessible discussion of these results, which are drawn from a longer paper [26] that has appeared elsewhere.

    AB - We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász Local Lemma in probabilistic combinatorics. We show that the conclusion of the Lovász Local Lemma holds for dependency graph $G$ and probabilities {p x} if and only if the independent-set polynomial for $G$ is nonvanishing in the polydisc of radii {p x}. Furthermore, we show that the usual proof of the Lovász Local Lemma - which provides a sufficient condition for this to occur - corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer [28] and explicitly by Dobrushin [12, 13]. We also present a generalization of the Lovász Local Lemma that allows for 'soft' dependencies. The paper aims to provide an accessible discussion of these results, which are drawn from a longer paper [26] that has appeared elsewhere.

    UR - http://www.scopus.com/inward/record.url?scp=29844456285&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=29844456285&partnerID=8YFLogxK

    U2 - 10.1017/S0963548305007182

    DO - 10.1017/S0963548305007182

    M3 - Article

    VL - 15

    SP - 253

    EP - 279

    JO - Combinatorics Probability and Computing

    JF - Combinatorics Probability and Computing

    SN - 0963-5483

    IS - 1-2

    ER -