Borel selector for hypergraphons
Abstract
We show that there is a Borel way of choosing a representative of a k-uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.