Professional Documents
Culture Documents
Dominik Flegel
1 Introduction
So far, we have seen a bunch of properties and generalizations of exchange-
able random variables (many of them building on the basic theorem of de
Finetti). These highly technical results can be applied to obtain non-trivial
results regarding random edge colorings of suciently regular hypergraphs
on a countably innite vertex set S .
2 Framework
We start by establishing the setting considered during this presentation.
Unless stated otherwise, let S be a countably innite set.
Denition 2.1 (Hypergraphs). A hypergraph on S is a set G P(S). It
is k-uniform if e G |e| = k, and complete k-uniform if |e| = k
e G. By abuse of notation, we denote the latter as S
.
k
Note that in contrast to the usual case k = 2 with nite vertex set,
we describe our hypergraphs implicitly by specifying the edge set (which is
eectively nothing else than an array), dropping S in the denition. Based
on this, colored hypergraphs are now dened in the most intuitive way:
Denition 2.2 (Colored hypergraphs). For a nite set K , a K-colored,
k-uniform hypergraph on S is a map H : Sk K . A K-colored, k-
It's not unusual to extend this denition allowing standard Borel spaces
as palettes. However, as the set K corresponds to eligible colors of the
kedges, this nite restriction will do for our needs.
1
3 Structure of random colorings
Building on a denition installed in a previous talk, we can give a brief
description of exchangeability in our new context.
Denition 3.1 (Exchangeable hypergraphs). A random K-colored, k-uniform
hypergraph H (often identied with its law ) is called exchangeable if the
array (He )e(S ) is (jointly) exchangeable (as dened in Raaella's presenta-
k
tion, i.e. if the coloring distribution does not depend on vertex relabeling).
In order to consolidate the numerous denitions to this point, we state
the most basic (non-trivial) examples of exchangeable hypergraphs:
Example 1 (H-sampling random hypergraph). Let H be a xed K-colored,
k-uniform hypergraph with loops on a nite set V . Obtain a random K-
colored, k-uniform hypergraph on S by sampling for each s S a vertex
vs V independently and uniformly at random and setting
The general idea behind this extended kind of sampling is to allow for
more sources of randomness by conditioning on the information given by
colorings of lower ranked edges. In this case, the color of e simply is 1 if
at least one of the contained 2-edges is colored 1. For higher k, there is an
obvious extension of this technique by iterating the procedure, resulting in
a sampling construction passing through each rank in between.
Proposition 3.2. There is no H (as described in example 1) such that
= H , where is the intermediate step sampling random hypergraph.
2
Sketch of Proof. Consider a partition of S into two innite subsets (i.e. S =
2 ) and assume there is any H-sampling random hypergraph such that
S1 S
H = . For each s S1 , dene the -algebras T (s) := ((H(e))e({s}S2 ) )
3
and T := sS1 T (s). It can be shown that under the assumed vertex-
W
sampling-only structure of the random variables (H(e))e(S ) are relatively
3
independent over T . On top of that, if |e1 e2 | = 2 for e1 , e2 S3 (i.e. if
they share exactly one 2-edge) then the joint behavior of H(e1 ) and H(e2 )
is already independent from T , this yields a contradiction as in that case
25 7
{H(e1 ) = 1, H(e2 ) = 1} = 6= ( )2 = {H(e1 ) = 1} {H(e2 ) = 1}.
32 8
to P2 (z , zs1 , zs2 , ).
..
.
3
Moreover, we dene that the ingredients yield upon following the
standard recipe for the induced law on K ( k ) .
S
The central result is that all exchangeable colorings are fully char-
acterized by following the standard recipe for an appropriate sequence of
ingredients:
Theorem 3.5 (Structure of uniform exchangeable hypergraph colorings).
For any k-uniform exchangeable colored random hypergraph there is some
sequence of ingredients
Pk (ze , ) := E[1{f (ze ,t)} |z] for all e Sk , ze = (zb )b2e \e where the
4
is some Borel measurable map f : X [0, 1] Y such that, endowing
X [0, 1] with the product measure 1 , the kernel P (x, ) is a version of
the conditional distribution of f (x, ) given the rst coordinate x:
Proof. Identify Y with a Borel subset of [0, 1], the function dened by
4 Outlook
The notion of hypergraph colorings can be extended and applied in various
ways, a few of them are branched shortly below.
As we are considering complete hypergraphs , some results can be
S
k
carried over to the study of random hypergraphs, by simply setting
K = {0, 1} with the interpretation of an edge being present or absent
depending on its color.
While performing the standard recipe, every edge up to a given size
is assigned to some value in a standard Borel space Zi under some
i , which is not stored in the nal result. With use of a generalized
palette K = (Ki )ki=0 (where Ki nite) and Borel maps i : Zi Ki
one can
obtain similar structural results for an exchangeable coloring
of k
S
:= ki=0 Si .