Independent sets of a given size and structure in the hypercube
Combinatorics, Probability and Computing · 2022-07 · 31 (4) · 702-720
DOI: 10.1017/s0963548321000559 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorics, Probability and Computing, online erschienen am 06.01.2022. Verfasst von Matthew Jenssen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 20 Literaturangaben.
Abstract (Originalsprache)
We 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.
Zitieren
APA
Jenssen, M., Perkins, W., & Potukuchi, A. (2022). Independent sets of a given size and structure in the hypercube. Combinatorics, Probability and Computing, 31(4), 702-720. https://doi.org/10.1017/s0963548321000559
Vancouver
Jenssen M, Perkins W, Potukuchi A. Independent sets of a given size and structure in the hypercube. Combinatorics, Probability and Computing. 2022;31(4):702-720. doi:10.1017/s0963548321000559
BibTeX
@article{Jenssen2022,
author = {Jenssen, Matthew and Perkins, Will and Potukuchi, Aditya},
title = {Independent sets of a given size and structure in the hypercube},
journal = {Combinatorics, Probability and Computing},
year = {2022},
volume = {31},
number = {4},
pages = {702--720},
doi = {10.1017/s0963548321000559}
}
EUVIMED