Documentation

TauCeti.Combinatorics.DenseGraphLimits.ExchangeableGraphLaw.Correspondence

Exchangeable graph laws correspond to mixing measures on graphon space #

The mixture map from probability measures on the graphon space over the unit interval to exchangeable graph laws is injective (mixtureExchangeableLaw_injective): a mixture law determines its mixing measure. Together with existence (exists_mixtureExchangeableLaw_eq) this makes the mixture map a bijection, packaged as mixtureExchangeableLawEquiv. This is the Diaconis–Janson correspondence at the level of the finite marginals. Uniqueness holds on the graphon quotient GraphonSpaceI, not among graphon representatives.

Main definitions #

Main results #

References #

Uniqueness of the mixing measure. Two probability measures on GraphonSpaceI with the same mixture law are equal.