A Partial Characterization of Robinsonian $L^p$ Graphons
Teddy Mishura

TL;DR
This paper characterizes Robinsonian $L^p$ graphons for $p > 5$, showing they are limits of graphs with vanishing Robinson parameter, extending understanding of graphon limits and properties.
Contribution
It provides a partial characterization of Robinsonian $L^p$ graphons for $p > 5$, linking them to the limit of graphs with a specific parameter approaching zero.
Findings
Robinsonian $L^p$ graphons are limits of graphs with $ ext{Lambda}$ parameter tending to zero.
For $p > 5$, Robinsonian $L^p$ graphons are exactly those that are cut distance limits of such graphs.
The paper uses functional analytic methods to establish this characterization.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Point processes and geometric inequalities
