A Thinning Analogue of de Finetti's Theorem
Abstract
We consider a notion of uniform thinning for a finite sequence of random variables (X1,...,Xn) obtained by removing one random variable, uniformly at random. If a triangular array of random variables (Xn,k : n ∈ N+, 1 k n) satisfies that the law of (Xn,1,...,Xn,n) is obtained by uniformly thinning (Xn+1,1,...,Xn+1,n+1), then we call the array thinning-invariant. We give a representation for the Choquet simplex of all thinning-invariant triangular arrays of random variables, when all random variables take values in a compact metric space (with Borel measurable distributions). We give two applications: to long-ranged, asymmetric classical spin chains, and long-ranged, asymmetric simple exclusion processes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.