A Partial Characterization of Robinsonian $L^p$ Graphons
Combinatorics
2024-12-02 v1
Abstract
We present a characterization of Robinsonian graphons for . Each graphon is the limit object of a sequence of edge density-normalized simple graphs under the cut distance . A graphon is Robinson if it satisfies the Robinson property: if , then , and it is Robinsonian if for some Robinson . In previous work, the author and collaborators introduced a graphon parameter that recognizes the Robinson property, where precisely when is Robinson. Using functional analytic arguments, we show here that for , the Robinsonian graphons are precisely those that are the cut distance limit object of graphs such that .
Cite
@article{arxiv.2411.18886,
title = {A Partial Characterization of Robinsonian $L^p$ Graphons},
author = {Teddy Mishura},
journal= {arXiv preprint arXiv:2411.18886},
year = {2024}
}
Comments
9 pages, 1 figure