"Infinite Exchangeability and Random Set Partitions"
نویسنده
چکیده
This talk aims to introduce a Bayesian idea on multiple comparisons or simultaneous inference. Instead of constructing statistics for comparing variety means in pairs, we start with an infinitely exchangeable Gaussian prior for the variety effects such that each pair of varieties is equal with positive prior probability. Consistency conditions on joint exchangeable priors involving set partitions are discussed. The marginal posterior distribution on variety partitions is studied in an effort to interpret the real relations among them. The comparison with classical results is also given, as well as the marginal posterior distribution on group means involving set partitions. Finally, some applications to cluster analysis are discussed.
منابع مشابه
Edge-exchangeable graphs and sparsity
A known failing of many popular random graph models is that the Aldous–Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability for random graphs in contrast to the established notion of infinite exchangea...
متن کاملReversible Markov structures on divisible set partitions
We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...
متن کاملApplied Probability Trust (1 October 2014) REVERSIBLE MARKOV STRUCTURES ON DIVISIBLE SET PAR- TITIONS
We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...
متن کاملExchangeable Random Processes and Data Abstraction
Several Turing-complete probabilistic programming languages such as Church, Venture and Anglican support so-called exchangeable random processes (XRPs) as built-in abstract data types. Instances of these data types denote infinite sequences of random values. Every such object satisfies the so-called exchangeability property, which says that the probability distribution of the object does not ch...
متن کاملFlexible Priors for Infinite Mixture Models
Most infinite mixture models in the current literature are based on the Dirichlet process prior. This prior on partitions implies a very specific (a priori) distribution on cluster sizes. A slightly more general prior known as the Pitman-Yor process prior generalizes this to a two-parameter family. The latter is the most general exchangeable partition probability function (EPPF) as defined by P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012