Benjamini-Schramm continuity of root moments of graph polynomials

DOI10.1016/J.EJC.2015.07.009MaRDI QIDQ896079zbMATHOpenAlexFDO

Authors Péter Csikvári, Péter E. Frenkel

Publication date 11 December 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.0463

zbMATH Keywords

Benjamini-Schramm convergent sequence of finite graphschromatic measure of a finite simple graph

Mathematics Subject Classification ID

Graph polynomials (05C31)

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.

Recommendations

• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Chromatic roots and limits of dense graphs
• Chromatic zeros on hierarchical lattices and equidistribution on parameter space
• Chromatic Roots are Dense in the Whole Complex Plane
• Chromatic polynomials

Cites work

• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• An introduction to chromatic polynomials
• Asymptotic Enumeration of Spanning Trees
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights
• Left and right convergence of graphs with bounded degree
• Mergelyan's Theorem on Uniform Polynomial Approximation.
• On the theory of the matching polynomial
• Problems in algebraic combinatorics
• Set maps, umbral calculus, and the chromatic polynomial
• Some variants of the exponential formula, with application to the multivariate Tutte polynomial (alias Potts model)
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems
• Two remarks on the adjoint polynomial

Cited in

(21)

• The Ising partition function: zeros and deterministic approximation
• Correlation decay and the absence of zeros property of partition functions
• Chromatic roots and limits of dense graphs
• Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros
• Weighted counting of solutions to sparse systems of equations
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
• Zero-free regions of partition functions with applications to algorithms and graph limits
• Distribution of coefficients of rank polynomials for random sparse graphs
• Convergence of graphs with intermediate density
• Random cluster model on regular graphs
• Evaluations of Tutte polynomials of regular graphs
• Integrating products of quadratic forms
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Statistical Matching Theory
• Characteristic power series of graph limits
• Matchings in Benjamini-Schramm convergent graph sequences
• Approximating permanents and hafnians
• Computing the number of induced copies of a fixed graph in a bounded degree graph
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials

This page was built for publication: Benjamini-Schramm continuity of root moments of graph polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896079)