Benjamini--Schramm continuity of root moments of graph polynomials
Preprint
Abstract
Recently, M.\ Ab\'ert and T.\ Hubai studied the following problem. The chromatic measure of a finite simple graph is defined to be the uniform distribution on its chromatic roots. Ab\'ert and Hubai proved that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments. They also showed that the normalized log of the chromatic polynomial converges to a harmonic real function outside a bounded disc. In this paper we generalize their work to a wide class of graph polynomials, namely, multiplicative graph polynomials of bounded exponential type. A special case of our results is that for any fixed complex number $v_0$ the measures arising from the Tutte polynomial $Z_{G_n}(z,v_0)$ converge in holomorphic moments if the sequence $(G_n)$ of finite graphs is Benjamini--Schramm convergent. This answers a question of Ab\'ert and Hubai in the affirmative. Even in the original case of the chromatic polynomial, our proof is considerably simpler.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphsCombinatorica, 2014
- Complex zero-free regions at large for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weightsJournal of Combinatorial Theory, Series B, 2013
- Two remarks on the adjoint polynomialEuropean Journal of Combinatorics, 2012
- Left and right convergence of graphs with bounded degreeRandom Structures & Algorithms, 2012
- Set maps, umbral calculus, and the chromatic polynomialDiscrete Mathematics, 2008
- Absence of Zeros for the Chromatic Polynomial on Bounded Degree GraphsCombinatorics, Probability and Computing, 2006
- Asymptotic Enumeration of Spanning TreesCombinatorics, Probability and Computing, 2005
- The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lov sz Local LemmaJournal of Statistical Physics, 2005
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition FunctionsCombinatorics, Probability and Computing, 2001
- Mergelyan's Theorem on Uniform Polynomial Approximation.MATHEMATICA SCANDINAVICA, 1964