This is the authors' abstract. We don't add key points for this paper.
We determine the asymptotics of the number of independent sets of size β 2ᵈ⁻¹ in the discrete hypercube Qd = \0,1\ᵈ for any fixed β ∈ (0,1) as d → ∞ , extending a result of Galvin for β ∈ (1-1/√2,1) . Moreover, we prove a multivariate local central limit theorem for structural features of independent sets in Qd drawn according to the hard-core model at any fixed fugacity λ>0 . In proving these results we develop several general tools for performing combinatorial enumeration using polymer models and the cluster expansion from statistical physics along with local central limit theorems.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Jenssen et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: