TL;DR
This paper demonstrates a Borel method for selecting representatives of k-uniform hypergraphons, extending previous results from graphons to hypergraphons, which facilitates measurable selections in hypergraph limit theory.
Contribution
It introduces a Borel selector for hypergraphons, generalizing the existing graphon selector, thus advancing measurable selection techniques in hypergraph limit theory.
Findings
Established a Borel selector for hypergraphons
Extended graphon selection results to hypergraphons
Facilitated measurable analysis in hypergraph limit theory
Abstract
We show that there is a Borel way of choosing a representative of a -uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons.
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 Topology and Set Theory · Limits and Structures in Graph Theory · Mathematical and Theoretical Analysis