Abstract:The hard-core model can be used to understand the number of independent sets in graphs in extremal graph theory. The occupancy fraction, defined by Davies \textit{et al.} in 2017 as the logarithmic derivative of the independence polynomial of a graph, is a key quantity in the hard-core model. The variance fraction, introduced by Davies \textit{et al.} in 2025, is defined as the derivative of the occupancy fraction with respect to the logarithm of the fugacity. Since the occupancy fraction can be obtained by integrating the variance fraction with respect to the logarithm of the fugacity, bounding the variance fraction yields the corresponding bounds on the occupancy fraction. Moreover, the occupancy fraction correlates, in quantity, to the independence polynomial.
In this note we provide two lower bounds on the variance fraction, proving the conjecture by Davies \textit{et al.} in 2025, for graphs with bounded maximum degree and for graphs with $n$ vertices, respectively. We also derive lower bounds for other graph classes, including graphs with a given edge chromatic number, $d$-regular graphs, and triangle-free graphs with bounded maximum degree.
From: Kexiang Xu [view email]
[v1]
Thu, 2 Apr 2026 07:31:18 UTC (16 KB)
[v2]
Fri, 5 Jun 2026 02:09:51 UTC (17 KB)
[v3]
Mon, 17 Aug 2026 10:54:58 UTC (12 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。