Evaluating moments of length of Pitman partition
Koji Tsukuda

TL;DR
This paper analyzes the asymptotic behavior of the moments of the length of partitions generated by the Pitman sampling formula, providing refined approximations under various asymptotic regimes.
Contribution
It offers new asymptotic evaluations of the moments of the partition length, improving accuracy over previous results and considering simultaneous growth of parameters.
Findings
Asymptotic formulas for the first and higher moments of K.
Refined approximations as n→∞.
Results for parameters with θ/n→0.
Abstract
The Pitman sampling formula has been intensively studied as a distribution of random partitions. One of the objects of interest is the length of a random partition that follows the Pitman sampling formula, where , and are parameters. This paper presents asymptotic evaluations of its -th moment () under two asymptotic regimes. In particular, the goals of this study are to provide a finer approximate evaluation of as than has previously been developed and to provide an approximate evaluation of as the parameters and simultaneously tend to infinity with . The results presented in this paper will provide a more accurate understanding of the asymptotic behavior of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Stochastic processes and statistical mechanics · Algorithms and Data Compression
