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 partitions

Authors: Alexander Gnedin 1

  • 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.

https://doi.org/10.46298/dmtcs.3479
Source: HAL:hal-01184681v1
Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: exchangeability,paintbox,stick-breaking,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV math/0508131
Source : ScholeXplorer IsRelatedTo DOI 10.1155/imrn/2006/51968
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0508131
  • math/0508131
  • 10.1155/imrn/2006/51968
  • 10.1155/imrn/2006/51968
  • 10.48550/arxiv.math/0508131
Coherent permutations with descent statistic and the boundary problem for the graph of zigzag diagrams

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 250 times.
This article's PDF has been downloaded 147 times.