Random Structures & Algorithms
A Characterization of GEM Distributions
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
The Infinite Latent Events Model
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
A Bayesian model for unsupervised semantic parsing
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Bayesian policy search with policy priors
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Crosslingual induction of semantic roles
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
We know how you live: exploring the spectrum of urban lifestyles
Proceedings of the first ACM conference on Online social networks
Hi-index | 0.00 |
This paper introduces a split-and-merge transformation of interval partitions which combines some features of one model studied by Gnedin and Kerov [12, 11] and another studied by Tsilevich [30, 31] and Mayer-Wolf, Zeitouni and Zerner [21]. The invariance under this split-and-merge transformation of the interval partition generated by a suitable Poisson process yields a simple proof of the recent result of [21] that a Poisson–Dirichlet distribution is invariant for a closely related fragmentation–coagulation process. Uniqueness and convergence to the invariant measure are established for the split-and-merge transformation of interval partitions, but the corresponding problems for the fragmentation–coagulation process remain open.