Zeros of the independence polynomial on recursive sequences of graphs

Source abstract

We study the hard-core model on recursively defined sequences $(G_n)_{n\geq0}$ of graphs with a fixed number $k\geq 1$ of labeled vertices in each graph. The next graph in the sequence is constructed by taking a fixed number $m\geq 2$ of copies of the previous graph, connecting these copies by identifying some labeled vertices according to a fixed rule, and afterward choosing $k$ labeled vertices in the resulting graph, again in accordance with a fixed rule. Examples of such sequences include the Sierpiński gasket graphs, hierarchical lattices, and many more. We prove that, when the vertex degrees of the graphs $G_n$ are uniformly bounded and the distances between the labeled vertices in $G_n$ diverge, the complex zeros of the univariate independence polynomials $Z_{G_n}(λ)$ avoid a neighborhood of the non-negative real axis. By the Lee--Yang theory this implies that no phase transitions occur for the hard-core model on these recursive sequences of graphs, independently of the starting graph $G_0$. The proof relies on the study of the dynamical properties of a one-parameter family of rational maps $F_λ$ on the $(2^k-1)$-dimensional complex projective space induced by the graph recursion operator. The dynamical framework developed in this paper can be naturally extended to other classical models in statistical mechanics (such as the Ising or Potts models) and to more general notions of graph recursions.