Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-25T17:31:40.048Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)