Finitary Bayesian statistical inference through partitions tree distributions

According to the Bayesian theory, observations are usually considered to be part of an infinite sequence of random elements that are conditionally inde pendent and identically distributed, given an unknown parameter. Such a parameter, which is the object of inference, depends on the entire sequence. Consequently, the unknown parameter cannot generally be observed, and any hypothesis about its realizations might be devoid of any empirical meaning. Therefore it becomes natural to focus attention on finite sequences of obser vations. The present paper introduces specific laws for finite exchangeable sequences and analyses some of their most relevant statistical properties. These laws, assessed through sequences of nested partitions, are strongly reminiscent of Polya-tree distributions and allow forms of conjugate analy sis. As a matter of fact, this family of distributions, called partitions tree distributions, contains the exchangeable laws directed by the more familiar Polya-tree processes. Moreover, the paper gives an example of partitions tree distribution connected with the hypergeometric urn scheme, where negative correlation between past and future observations is allowed