2020
DOI: 10.1112/jlms.12331
|View full text |Cite
|
Sign up to set email alerts
|

Independent sets in the hypercube revisited

Abstract: We revisit Sapozhenko's classic proof on the asymptotics of the number of independent sets in the discrete hypercube {0, 1} d and Galvin's follow-up work on weighted independent sets. We combine Sapozhenko's graph container methods with the cluster expansion and abstract polymer models, two tools from statistical physics, to obtain considerably sharper asymptotics and detailed probabilistic information about the typical structure of (weighted) independent sets in the hypercube. These results refine those of Ko… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
51
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 29 publications
(53 citation statements)
references
References 25 publications
(60 reference statements)
0
51
0
Order By: Relevance
“…Here we show that local central limit theorems work very well in combination with two tools from statistical physics, polymer models and the cluster expansion, which have been used recently in combinatorial enumeration [15,2,13].…”
Section: Theorem 3 (Jenssen and Perkins)mentioning
confidence: 90%
See 4 more Smart Citations
“…Here we show that local central limit theorems work very well in combination with two tools from statistical physics, polymer models and the cluster expansion, which have been used recently in combinatorial enumeration [15,2,13].…”
Section: Theorem 3 (Jenssen and Perkins)mentioning
confidence: 90%
“…and obtain explicit asymptotics for any fixed β. More generally, the results of [15] and of this paper hold for much smaller λ and β, tending to 0 as d → ∞, as long as λ ≥ C log d/d 1/3 and β > C log d/d 1/3 for an absolute constant C. In this case, however, the asymptotic formulas in Theorem 3 and Theorem 5 become series with a number of terms that grows with d. These series can be used to give an algorithm to approximate Z(λ) and i ⌊βN ⌋ (Q d ) up to a (1 + ε) multiplicative factor in time polynomial in 1/ε and N (an FPTAS in the language of approximate counting; see e.g. [14] for such an algorithm for independent sets in expander graphs).…”
Section: Theorem 3 (Jenssen and Perkins)mentioning
confidence: 92%
See 3 more Smart Citations