Finite Exchangeable Sequences

  • Diaconis P
  • Freedman D
N/ACitations
Citations of this article
99Readers
Mendeley users who have this article in their library.

Abstract

Let $X_1, X_2,\cdots, X_k, X_{k+1},\cdots, X_n$ be exchangeable random variables taking values in the set $S$. The variation distance between the distribution of $X_1, X_2,\cdots, X_k$ and the closest mixture of independent, identically distributed random variables is shown to be at most $2 ck/n$, where $c$ is the cardinality of $S$. If $c$ is infinite, the bound $k(k - 1)/n$ is obtained. These results imply the most general known forms of de Finetti's theorem. Examples are given to show that the rates $k/n$ and $k(k - 1)/n$ cannot be improved. The main tool is a bound on the variation distance between sampling with and without replacement. For instance, suppose an urn contains $n$ balls, each marked with some element of the set $S$, whose cardinality $c$ is finite. Now $k$ draws are made at random from this urn, either with or without replacement. This generates two probability distributions on the set of $k$-tuples, and the variation distance between them is at most $2 ck/n$.

Cite

CITATION STYLE

APA

Diaconis, P., & Freedman, D. (2007). Finite Exchangeable Sequences. The Annals of Probability, 8(4). https://doi.org/10.1214/aop/1176994663

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free