Table of Contents
Fetching ...

A refined graph container lemma and applications to the hard-core model on bipartite expanders

Matthew Jenssen, Alexandru Malekshahian, Jinyoung Park

TL;DR

This work refines the graph container method to extend structural results for the hard-core model on bipartite graphs, achieving a key improvement in the feasible activity range down to $\lambda = \tilde{\Omega}(d^{-1/2})$. The core technical advance is a refined container lemma (ML) implemented via an iterative $\psi$-approximation that yields finer containers at controlled cost, enabling a detailed cluster-expansion-style analysis on the hypercube and enabling a polynomial-time approximation scheme (FPTAS) and sampling for $Z_G(\lambda)$ on $d$-regular bipartite expanders. The results sharpen the understanding of the structured phase, showing that typical independent sets concentrate on one bipartition side even for smaller $\lambda$, and yield practical algorithmic consequences that surpass previous bounds. Together, these contribute both theoretical insights into phase structure and concrete tools for efficient computation of the hard-core partition function on expansive bipartite graphs.

Abstract

We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard-core model on bipartite expander graphs. Given a graph $G$ and $λ>0$, the hard-core model on $G$ at activity $λ$ is the probability distribution $μ_{G,λ}$ on independent sets in $G$ given by $μ_{G,λ}(I)\propto λ^{|I|}$. As one of our main applications, we show that the hard-core model at activity $λ$ on the hypercube $Q_d$ exhibits a `structured phase' for $λ= Ω( \log^2 d/d^{1/2})$ in the following sense: in a typical sample from $μ_{Q_d,λ}$, most vertices are contained in one side of the bipartition of $Q_d$. This improves upon a result of Galvin which establishes the same for $λ=Ω(\log d/ d^{1/3})$. As another application, we establish a fully polynomial-time approximation scheme (FPTAS) for the hard-core model on a $d$-regular bipartite $α$-expander, with $α>0$ fixed, when $λ= Ω( \log^2 d/d^{1/2})$. This improves upon the bound $λ=Ω(\log d/ d^{1/4})$ due to the first author, Perkins and Potukuchi. We discuss similar improvements to results of Galvin-Tetali, Balogh-Garcia-Li and Kronenberg-Spinka.

A refined graph container lemma and applications to the hard-core model on bipartite expanders

TL;DR

This work refines the graph container method to extend structural results for the hard-core model on bipartite graphs, achieving a key improvement in the feasible activity range down to . The core technical advance is a refined container lemma (ML) implemented via an iterative -approximation that yields finer containers at controlled cost, enabling a detailed cluster-expansion-style analysis on the hypercube and enabling a polynomial-time approximation scheme (FPTAS) and sampling for on -regular bipartite expanders. The results sharpen the understanding of the structured phase, showing that typical independent sets concentrate on one bipartition side even for smaller , and yield practical algorithmic consequences that surpass previous bounds. Together, these contribute both theoretical insights into phase structure and concrete tools for efficient computation of the hard-core partition function on expansive bipartite graphs.

Abstract

We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard-core model on bipartite expander graphs. Given a graph and , the hard-core model on at activity is the probability distribution on independent sets in given by . As one of our main applications, we show that the hard-core model at activity on the hypercube exhibits a `structured phase' for in the following sense: in a typical sample from , most vertices are contained in one side of the bipartition of . This improves upon a result of Galvin which establishes the same for . As another application, we establish a fully polynomial-time approximation scheme (FPTAS) for the hard-core model on a -regular bipartite -expander, with fixed, when . This improves upon the bound due to the first author, Perkins and Potukuchi. We discuss similar improvements to results of Galvin-Tetali, Balogh-Garcia-Li and Kronenberg-Spinka.

Paper Structure

This paper contains 17 sections, 23 theorems, 125 equations.

Key Result

Theorem 1.1

There exists $C>0$ so that the following holds. Let $C\log^2d /d^{1/2}\leq \lambda \leq \sqrt{2}-1$ and let $\mathbf{I}$ be sampled according to $\mu_{Q_d,\lambda}$. Then, with high probability, and where $\omega(1)$ is any function tending to infinity as $d\rightarrow\infty$.

Theorems & Definitions (40)

  • Theorem 1.1
  • Lemma 1.2
  • Conjecture 1.3
  • Remark 1.4
  • Theorem 1.5
  • Theorem 1.6: galvin2006slow
  • Theorem 1.7: sparsesperner
  • Theorem 1.8: kronenberg2022independent
  • Lemma 2.1: $\varphi$-approximation for approximately biregular graphs
  • Definition 2.2
  • ...and 30 more