Counting independent sets in percolated graphs via the Ising model

Anna Geisler, Mihyun Kang, Michail Sarantis +1

Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of in…