A graphon counter example

DOI10.1016/J.DISC.2020.111836zbMATH Open1437.05123arXiv1909.02911OpenAlexW3004791560MaRDI QIDQ2174580FDOQ2174580

Authors: Svante Janson 

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

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

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)