Constrained exchangeable partitions

Alexander Gnedin 1
1 Mathematical Institute
Abstract : 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.
Keywords : exchangeability paintbox stick-breaking
Type de document :
Communication dans un congrès
Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.391-398, 2006, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01184681
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 14:22:43
Dernière modification le : jeudi 11 mai 2017 - 01:03:03
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 10:43:58

Fichier

dmAG0131.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184681, version 1

Collections

INSMI | TDS-MACS

Citation

Alexander Gnedin. Constrained exchangeable partitions. Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.391-398, 2006, DMTCS Proceedings. 〈hal-01184681〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

44

Téléchargements de fichiers

80

Contact


archive-ouverte@inria.fr