A graphon counter example

DOI10.1016/J.DISC.2020.111836MaRDI QIDQ2174580zbMATH OpenOpenAlexFDO

Authors Svante Janson

Publication date 21 April 2020

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graphonweak equivalence

Mathematics Subject Classification ID

Combinatorial probability (60C05) Density (toughness, etc.) (05C42)

Abstract: We give an example of a graphon such that there is no equivalent graphon with a degree function that is (weakly) increasing.

Cites work

• Cost functionals for large (uniform and simply generated) random trees
• Graph limits and exchangeable random graphs
• Graphons, cut norm and distance, couplings and rearrangements
• Large networks and graph limits
• Limits of dense graph sequences
• Metrics for sparse graphs
• Moments of two-variable functions and the uniqueness of graph limits
• Threshold graph limits and random threshold graphs

This page was built for publication: A graphon counter example

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