Abstract
Some new exact distributions on coupon collector’s waiting time problems are given based on a generalized Polya urn sampling. In particular, usual Polya urn sampling generates an exchangeable random sequence. In this case, an alternative derivation of the distribution is also obtained from de Finetti’s theorem. In coupon collector’s waiting time problems with \(m\) kinds of coupons, the observed order of \(m\) kinds of coupons corresponds to a permutation of \(m\) letters uniquely. Using the property of coupon collector’s problems, a statistical model on the permutation group of \(m\) letters is proposed for analyzing ranked data. In the model, as the parameters mean the proportion of the \(m\) kinds of coupons, the observed ranking can be intuitively understood. Some examples of statistical inference are also given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Annals of the Institute of Statistical Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
