Alexander Gnedin
-
Constrained exchangeable partitions
dmtcs:3479 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
-
https://doi.org/10.46298/dmtcs.3479
Constrained exchangeable partitionsArticle
Authors: Alexander Gnedin 1
NULL
Alexander Gnedin
1 Mathematical Institute
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Bo Chen;Matthias Winkel, 2013, Restricted exchangeable partitions and embedding of associated hierarchies in continuum random trees, Annales de l'Institut Henri Poincaré. B, Probabilités et statistiques/Annales de l'I.H.P. Probabilités et statistiques, 49, 3, 10.1214/12-aihp533, https://doi.org/10.1214/12-aihp533.
Alexander V. Gnedin;Alexander M. Iksanov;Pavlo Negadajlov;Uwe Rösler, 2009, The Bernoulli sieve revisited, The Annals of applied probability/The annals of applied probability, 19, 4, 10.1214/08-aap592, https://doi.org/10.1214/08-aap592.
Alexander Gnedin, 2007, Coherent random permutations with record statistics, Discrete mathematics and theoretical computer science/Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AH,..., Proceedings, 10.46298/dmtcs.3551, https://doi.org/10.46298/dmtcs.3551.