Hostname: page-component-74656f9884-rngvg Total loading time: 0 Render date: 2026-11-06T09:32:24.238Z Has data issue: false hasContentIssue false
  • English
  • Français

Three Sampling Formulas

Published online by Cambridge University Press:  03 March 2004

ALEXANDER V. GNEDIN
ALEXANDER V. GNEDIN
Affiliation:
Department of Mathematics, Utrecht University, Postbus 80010, 3508 TA Utrecht, The Netherlands (e-mail: gnedin@math.uu.nl)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Sampling formulas describe probability laws of exchangeable combinatorial structures like partitions and compositions. We give a brief account of two known parametric families of sampling formulas for compositions and add a new family to the list.

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 2 , March 2004 , pp. 185 - 193
Copyright
2004 Cambridge University Press