Counting Independent Sets in Percolated Graphs via the Ising Model

ABSTRACT Given a graph , we form a random subgraph by including each edge of independently with probability . We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of Kronenberg and Spinka on the percolated hypercube. Combining graph containers with the cluster expansion from statistical physics, we give an expansion of the partition function of the Ising model in a certain range of the parameters. Among other applications, we obtain results for even tori of growing side‐length. As a tool, we prove a refined container lemma for the Ising model, which mildly improves recent bounds of Jenssen, Malekshahian, and Park.