Exchangeable Hoeffding decompositions over finite sets: A combinatorial characterization and counterexamples

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We study Hoeffding decomposable exchangeable sequences with values in a finite set D = {d1, . . . , d K} We provide a new combinatorial characterization of Hoeffding decomposability and use this result to show that, for every K ≥ 3, there exists a class of neither Pólya nor i.i.d. D-valued exchangeable sequences that are Hoeffding decomposable. © 2014 Elsevier Inc.

Cite

CITATION STYLE

APA

El-Dakkak, O., Peccati, G., & Prünster, I. (2014). Exchangeable Hoeffding decompositions over finite sets: A combinatorial characterization and counterexamples. Journal of Multivariate Analysis, 131, 51–64. https://doi.org/10.1016/j.jmva.2014.04.012

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