Hoeffding decompositions and two-colour urn sequences
classification
🧮 math.PR
keywords
sequencehoeffdingpolyaresultssequencescharacterizationscombinatorialcompared
read the original abstract
Let X be a non-deterministic infinite exchangeable sequence with values in {0,1}. We show that X is Hoeffding-decomposable if, and only if, X is either an i.i.d. sequence or a Polya sequence. This completes the results established in Peccati [2004]. The proof uses several combinatorial implications of the correspondence between Hoeffding decomposability and weak independence. Our results must be compared with previous characterizations of i.i.d. and Polya sequences given by Hill et al. [1987] and Diaconis and Yilvisaker [1979].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.