Benjamini-Schramm continuity of root moments of graph polynomials

DOI10.1016/j.ejc.2015.07.009zbMath1327.05159arXiv1204.0463OpenAlexW1541384556MaRDI QIDQ896079

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

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)

Related Items (20)

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

Cites Work

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

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