English

On the critical fugacity of the hard-core model on regular bipartite graphs

Probability 2026-03-31 v1 Statistical Mechanics Mathematical Physics Combinatorics math.MP

Abstract

We establish long-range order for the hard-core model on a finite, regular bipartite graph above a threshold fugacity given in terms of expansion parameters of the graph. The result applies to the dd-dimensional hypercube graph and, more generally, to dd-dimensional discrete tori of fixed side length, proving long-range order at fugacities λΩ(logdd)\lambda\ge\Omega(\frac{\log d}{d}). Furthermore, we use reflection positivity to transfer the result to the lattice Zd\mathbb{Z}^{d}, verifying the long-standing belief that its critical fugacity is of the form d1+o(1)d^{-1+o(1)} as dd\to\infty.

Keywords

Cite

@article{arxiv.2603.27144,
  title  = {On the critical fugacity of the hard-core model on regular bipartite graphs},
  author = {Daniel Hadas and Ron Peled},
  journal= {arXiv preprint arXiv:2603.27144},
  year   = {2026}
}

Comments

43 pages