Three Sampling Formulas
| dc.creator | Gnedin, Alexander | |
| dc.date | 2002-10-21 | |
| dc.date | 2002-10-22 | |
| dc.date.accessioned | 2026-07-07T04:52:11Z | |
| dc.date.available | 2026-07-07T04:52:11Z | |
| dc.description | 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. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0210319 | |
| dc.identifier | http://arxiv.org/abs/math/0210319 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65372 | |
| dc.subject | Probability | |
| dc.subject | 60G09 | |
| dc.title | Three Sampling Formulas | |
| dc.type | text |