Characteristic power series of graph limits
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3110499 (Why is no real title available?)
- A walk through combinatorics. An introduction to enumeration and graph theory. With a foreword by Richard Stanley
- Benjamini-Schramm continuity of root moments of graph polynomials
- 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
- Chromatic polynomials of random graphs
- Chromatic roots and limits of dense graphs
- Graphs and matrices with maximal energy
- Interpolation and the Laguerre-PĂłlya class
- Interpolation zwischen den Klassen đp von Operatoren in Hilberträumen
- Jensen polynomials for the Riemann zeta function and other sequences
- Large networks and graph limits
- Left and right convergence of graphs with bounded degree
- Limits of kernel operators and the spectral regularity lemma
- Matching polytons
- Quasi-random graphs
- The Determinant of the Adjacency Matrix of a Graph
Cited in
(2)
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)