pith. sign in

arxiv: math/0210319 · v2 · submitted 2002-10-21 · 🧮 math.PR

Three Sampling Formulas

classification 🧮 math.PR
keywords formulassamplingaccountbriefcombinatorialcompositionsdescribeexchangeable
0
0 comments X
read the original 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 and add a new family to the list.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.