pith. sign in

arxiv: 2411.18886 · v1 · pith:EP5S7YCWnew · submitted 2024-11-28 · 🧮 math.CO

A Partial Characterization of Robinsonian L^p Graphons

classification 🧮 math.CO
keywords robinsonrobinsoniangraphongraphonslambdacharacterizationdeltadistance
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.