Characteristic Power Series of Graph Limits
Preprint
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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Chromatic roots and limits of dense graphsDiscrete Mathematics, 2017
- Benjamini–Schramm continuity of root moments of graph polynomialsEuropean Journal of Combinatorics, 2016
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphsCombinatorica, 2014
- Large Networks and Graph Limits2012
- Left and right convergence of graphs with bounded degreeRandom Structures & Algorithms, 2012
- Limits of kernel operators and the spectral regularity lemmaEuropean Journal of Combinatorics, 2011
- Chromatic polynomials of random graphsJournal of Physics A: Mathematical and Theoretical, 2010
- Graphs and matrices with maximal energyJournal of Mathematical Analysis and Applications, 2007
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition FunctionsCombinatorics, Probability and Computing, 2001
- Quasi-random graphsCombinatorica, 1989