Monotone graph limits and quasimonotone graphs

DOI10.1080/15427951.2012.687243MaRDI QIDQ4905098zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Svante Janson, Oliver Riordan

Publication date 15 February 2013

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.4296, https://projecteuclid.org/euclid.im/1345581011

graph limits graph sequences graphon kernel quasimonotonicity sequences of graphs symmetric function

Density (toughness, etc.) (05C42) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (05C99) Symmetric functions and generalizations (05E05) Exchangeability for stochastic processes (60G09)

Abstract: The recent theory of graph limits gives a powerful framework for understanding the properties of suitable (convergent) sequences

(G_{n})

of graphs in terms of a limiting object which may be represented by a symmetric function

W

on

[0, 1]

, i.e., a kernel or graphon. In this context it is natural to wish to relate specific properties of the sequence to specific properties of the kernel. Here we show that the kernel is monotone (i.e., increasing in both variables) if and only if the sequence satisfies a `quasi-monotonicity' property defined by a certain functional tending to zero. As a tool we prove an inequality relating the cut and

L^{1}

norms of kernels of the form

W_{1} - W_{2}

with

W_{1}

and

W_{2}

monotone that may be of interest in its own right; no such inequality holds for general kernels.

Recommendations

Cited in

(5)

This page was built for publication: Monotone graph limits and quasimonotone graphs

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