Extreme jointly exchangeable array laws #
A jointly exchangeable probability law on array path space ℕ × ℕ → α is an extreme point of
the convex set of jointly exchangeable probability laws if and only if its coordinate array is
jointly dissociated. With the corner-tail theorem and the ergodicity theorem this completes the
representation-free triangle for jointly exchangeable arrays: joint dissociation, triviality of
the corner tail, ergodicity of the diagonal finitary relabelling action, and extremality are one
condition, stated on the law alone for any measurable value space.
The jointly exchangeable probability laws are the invariant probability laws for the diagonal
finitary action established in Arrays.Ergodic. The extreme-point characterisation is the general
one for a countable group action, ErgodicSMul.iff_mem_extremePoints, composed with
jointlyDissociated_iff_ergodicSMul.
Main results #
TauCeti.Probability.jointlyExchangeableProbabilityMeasures— the convex set, and its identification with the invariant measures of total mass one of the diagonal action;TauCeti.Probability.jointlyDissociated_iff_mem_extremePoints— joint dissociation is extremality among jointly exchangeable probability laws, withjointlyDissociated_of_mem_extremePointsreading dissociation off an extreme point;TauCeti.Probability.jointlyExchangeableProbabilityMeasuresOn— the jointly exchangeable probability laws carried by a set of arrays, a face of the whole set, so thatjointlyDissociated_iff_mem_extremePoints_onrestricts the characterisation to them, andjointlyExchangeableProbabilityMeasuresOnSymmetricArraysWithDiagthe case of the symmetric arrays with a fixed diagonal, the adjacency arrays of graphs whenα = Bool;TauCeti.Probability.JointlyDissociated.ae_eq_of_comp_eq— the integral form: a jointly dissociated law written as a mixture of jointly exchangeable laws has almost every component equal to itself.
References #
- D. Aldous, "Representations for partially exchangeable arrays of random variables", Journal of Multivariate Analysis 11 (1981), 581--598.
- O. Kallenberg, Probabilistic Symmetries and Invariance Principles, Springer, 2005, Chapter 7.
- P. Diaconis, S. Janson, Graph limits and exchangeable random graphs, Rend. Mat. Appl. (7) 28 (2008), 33–61, Section 5: exchangeable random graphs as symmetric zero-diagonal arrays, and dissociated laws as the extreme ones.
The convex set of jointly exchangeable probability laws on array path space.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Membership in the jointly exchangeable probability laws.
The jointly exchangeable probability laws are the probability laws invariant under the diagonal finitary action.
The jointly exchangeable probability laws form a convex set.
Joint dissociation is extremality: a jointly exchangeable probability law is an extreme point of the jointly exchangeable probability laws if and only if its coordinate array is jointly dissociated.
The jointly exchangeable probability laws carried by a set s of arrays: those giving mass
zero to sᶜ.
Equations
Instances For
Membership in the jointly exchangeable laws carried by s.
The jointly exchangeable laws carried by s are a face of all jointly exchangeable
probability laws.
The jointly exchangeable laws carried by s form a convex set.
The extreme points of the jointly exchangeable laws carried by s are the extreme jointly
exchangeable laws so carried.
Joint dissociation is extremality among the laws carried by s: a jointly exchangeable
probability law carried by s is an extreme point of the jointly exchangeable laws carried by s
if and only if its coordinate array is jointly dissociated.
An extreme point of the jointly exchangeable probability laws is jointly exchangeable.
An extreme point of the jointly exchangeable probability laws is a probability law.
The coordinate array of an extreme point of the jointly exchangeable probability laws is jointly dissociated.
The coordinate array of an extreme point of the jointly exchangeable laws carried by s is
jointly dissociated.
The jointly exchangeable probability laws carried by the symmetric arrays with diagonal d.
For α = Bool and d = false the carrier is the adjacency arrays of the simple graphs on ℕ,
and these are the laws of exchangeable random graphs read as arrays.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The jointly exchangeable laws carried by the symmetric arrays are the carried laws at that carrier.
Membership in the jointly exchangeable laws carried by the symmetric arrays.
A jointly dissociated array law is not a nontrivial mixture of jointly exchangeable
laws. If ρ is the mixture κ ∘ₘ π of a Markov kernel whose laws are almost all jointly
exchangeable, then almost every κ z is ρ itself. This is the integral form of
jointlyDissociated_iff_mem_extremePoints.