Characteristic power series of graph limits

DOI10.1016/J.EJC.2022.103629zbMATH Open1504.05157arXiv1906.05778OpenAlexW2952229247MaRDI QIDQ2107495FDOQ2107495

Authors: Joshua Cooper 

Publication date: 1 December 2022

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

Abstract: In this note, we show how to obtain a "characteristic power series" of graphons -- infinite limits of dense graphs -- as the limit of normalized reciprocal characteristic polynomials. This leads to a new characterization of graph quasi-randomness and another perspective on spectral theory for graphons, a complete description of the function in terms of the spectrum of the graphon as a self-adjoint kernel operator. Interestingly, while we apply a standard regularization to classical determinants, it is unclear how necessary this is.

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

Recommendations

• From quasirandom graphs to graph limits and graphlets
• Quasi-random graphs and graph limits
• Limits of kernel operators and the spectral regularity lemma
• Random graphons and a weak positivstellensatz for graphs
• Limits of dense graph sequences

zbMATH Keywords

graph quasi-randomnesspower series of graphons

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Large networks and graph limits
• Interpolation zwischen den Klassen 𝔖_p von Operatoren in Hilberträumen
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Quasi-random graphs
• Graphs and matrices with maximal energy
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Left and right convergence of graphs with bounded degree
• Chromatic roots and limits of dense graphs
• Benjamini-Schramm continuity of root moments of graph polynomials
• Title not available (Why is that?)
• The Determinant of the Adjacency Matrix of a Graph
• Limits of kernel operators and the spectral regularity lemma
• Chromatic polynomials of random graphs
• Jensen polynomials for the Riemann zeta function and other sequences
• Interpolation and the Laguerre-Pólya class
• Matching polytons
• A walk through combinatorics. An introduction to enumeration and graph theory. With a foreword by Richard Stanley

Cited In (2)

• Limits of kernel operators and the spectral regularity lemma
• Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier–Hermite polynomials

This page was built for publication: Characteristic power series of graph limits

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