Abstract
AbstractWe determine the asymptotics of the number of independent sets of size
$\lfloor \beta 2^{d-1} \rfloor$
in the discrete hypercube
$Q_d = \{0,1\}^d$
for any fixed
$\beta \in (0,1)$
as
$d \to \infty$
, extending a result of Galvin for
$\beta \in (1-1/\sqrt{2},1)$
. Moreover, we prove a multivariate local central limit theorem for structural features of independent sets in
$Q_d$
drawn according to the hard-core model at any fixed fugacity
$\lambda>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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献