English

A Partial Characterization of Robinsonian $L^p$ Graphons

Combinatorics 2024-12-02 v1

Abstract

We present a characterization of Robinsonian LpL^p graphons for p>5p > 5. Each LpL^p graphon ww is the limit object of a sequence of edge density-normalized simple graphs {Gn/Gn1}\{G_n/\|G_n\|_1\} under the cut distance δ\delta_{\Box}. A graphon ww is Robinson if it satisfies the Robinson property: if xyzx\leq y\leq z, then w(x,z)min{w(x,y),w(y,z)}w(x,z)\leq \min\{w(x,y),w(y,z)\}, and it is Robinsonian if δ(w,u)=0\delta_{\Box}(w,u)=0 for some Robinson uu. In previous work, the author and collaborators introduced a graphon parameter Λ\Lambda that recognizes the Robinson property, where Λ(w)=0\Lambda(w) = 0 precisely when ww is Robinson. Using functional analytic arguments, we show here that for p>5p > 5, the Robinsonian LpL^p graphons ww are precisely those that are the cut distance limit object of graphs GnG_n such that Λ(Gn/Gn1)0\Lambda(G_n/\|G_n\|_1) \to 0.

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

R2 v1 2026-06-28T20:15:28.593Z