scholarly journals Independent sets of a given size and structure in the hypercube

2022 ◽  
pp. 1-19
Author(s):  
Matthew Jenssen ◽  
Will Perkins ◽  
Aditya Potukuchi
Keyword(s):  
Central Limit ◽  
Statistical Physics ◽  
Limit Theorems ◽  
Hard Core ◽  
Independent Sets ◽  
Structural Features ◽  
Combinatorial Enumeration ◽  
Polymer Models ◽  
Local Central Limit Theorem ◽  
Hard Core Model

Abstract 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.

An Entropy Approach to the Hard-Core Model on Bipartite Graphs

2001 ◽  
Vol 10 (3) ◽  
pp. 219-237 ◽  
Author(s):  
JEFF KAHN
Keyword(s):  
Phase Transition ◽  
Bipartite Graph ◽  
Upper Bound ◽  
Hard Core ◽  
Independent Set ◽  
Independent Sets ◽  
Bipartite Graphs ◽  
Core Model ◽  
Hard Core Model ◽  
Regular Bipartite Graph

We use entropy ideas to study hard-core distributions on the independent sets of a finite, regular bipartite graph, specifically distributions according to which each independent set I is chosen with probability proportional to λ[mid ]I[mid ] for some fixed λ > 0. Among the results obtained are rather precise bounds on occupation probabilities; a ‘phase transition’ statement for Hamming cubes; and an exact upper bound on the number of independent sets in an n-regular bipartite graph on a given number of vertices.

scholarly journals Improved inapproximability results for counting independent sets in the hard-core model

2012 ◽  
Vol 45 (1) ◽  
pp. 78-110 ◽  
Author(s):  
Andreas Galanis ◽  
Qi Ge ◽  
Daniel Štefankovič ◽  
Eric Vigoda ◽  
Linji Yang
Keyword(s):  
Hard Core ◽  
Independent Sets ◽  
Core Model ◽  
Hard Core Model

scholarly journals The Almost Sure Local Central Limit Theorem for the Negatively Associated Sequences

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yuanying Jiang ◽  
Qunying Wu
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Random Variables ◽  
Central Limit Theorems ◽  
Associated Random Variables ◽  
Negatively Associated ◽  
Associated Sequences ◽  
Local Central Limit Theorem

In this paper, the almost sure central limit theorem is established for sequences of negatively associated random variables:limn→∞(1/logn)∑k=1n(I(ak≤Sk<bk)/k)P(ak≤Sk<bk)=1, almost surely. This is the local almost sure central limit theorem for negatively associated sequences similar to results by Csáki et al. (1993). The results extend those on almost sure local central limit theorems from the i.i.d. case to the stationary negatively associated sequences.

scholarly journals Bounding the Partition Function of Spin-Systems

10.37236/1098 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
David J. Galvin
Keyword(s):  
Ising Model ◽  
Partition Function ◽  
Probability Distribution ◽  
Statistical Physics ◽  
Hard Core ◽  
Spin Systems ◽  
Normalizing Constant ◽  
Graph Homomorphisms ◽  
Hard Core Model ◽  
Regular Bipartite Graph

With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\bigcup_{v\in V}\{\lambda_{i,v}:1\leq i \leq m\} \cup \bigcup_{uv \in E} \{\lambda_{ij,uv}:1\leq i \leq j \leq m\}.$ We consider the probability distribution on $\{f:V\rightarrow\{1,\ldots,m\}\}$ in which each $f$ occurs with probability proportional to $\prod_{v \in V}\lambda_{f(v),v}\prod_{uv \in E}\lambda_{f(u)f(v),uv}$. Many well-known statistical physics models, including the Ising model with an external field and the hard-core model with non-uniform activities, can be framed as such a distribution. We obtain an upper bound, independent of $G$, for the partition function (the normalizing constant which turns the assignment of weights on $\{f:V\rightarrow\{1,\ldots,m\}\}$ into a probability distribution) in the case when $G$ is a regular bipartite graph. This generalizes a bound obtained by Galvin and Tetali who considered the simpler weight collection $\{\lambda_i:1 \leq i \leq m\} \cup \{\lambda_{ij}:1 \leq i \leq j \leq m\}$ with each $\lambda_{ij}$ either $0$ or $1$ and with each $f$ chosen with probability proportional to $\prod_{v \in V}\lambda_{f(v)}\prod_{uv \in E}\lambda_{f(u)f(v)}$. Our main tools are a generalization to list homomorphisms of a result of Galvin and Tetali on graph homomorphisms and a straightforward second-moment computation.

scholarly journals Reconstruction Thresholds on Regular Trees

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
James B. Martin
Keyword(s):  
Statistical Physics ◽  
Gibbs Measures ◽  
Rooted Tree ◽  
Hard Core ◽  
Core Model ◽  
A Value ◽  
Binary State ◽  
International Audience ◽  
Hard Core Model ◽  
Special Case

International audience We consider themodel of broadcasting on a tree, with binary state space, on theinfinite rooted tree $T^k$ in which each node has $k$ children. The root of the tree takesa random value $0$ or $1$, and then each node passes a value independently to each of its children according to a $2x2$ transition matrix $\mathbf{P}$. We say that reconstruction is possible if the values at the dth level of the tree contain non-vanishing information about the value at the root as $d→∞$. Extending a method of Brightwell and Winkler, we obtain new conditions under which reconstruction is impossible, both in the general case and in the special case $p_11=0$. The latter case is closely related to the hard-core model from statistical physics; a corollary of our results is that, for the hard-core model on the $(k+1)$-regular tree with activity $λ =1$, the unique simple invariant Gibbs measure is extremal in the set of Gibbs measures, for any $k ≥ 2$.

scholarly journals Pressure Function and Limit Theorems for Almost Anosov Flows

2021 ◽  
Vol 382 (1) ◽  
pp. 1-47
Author(s):  
Henk Bruin ◽  
Dalia Terhesiu ◽  
Mike Todd
Keyword(s):  
Thermodynamic Properties ◽  
Central Limit ◽  
Limit Theorems ◽  
Central Limit Theorems ◽  
Stable Laws ◽  
Analytic Framework ◽  
Pressure Function ◽  
Hyperbolic Flows ◽  
Anosov Flows ◽  
Almost Anosov

AbstractWe obtain limit theorems (Stable Laws and Central Limit Theorems, both standard and non-standard) and thermodynamic properties for a class of non-uniformly hyperbolic flows: almost Anosov flows, constructed here. The link between the pressure function and limit theorems is studied in an abstract functional analytic framework, which may be applicable to other classes of non-uniformly hyperbolic flows.

Sign in / Sign up

Export Citation Format

Share Document