Asymptotic equidistribution of congruence classes with respect to the convolution iterates of a probability vector
Consider a positive integer d and a positive probability vector f over the numbers 0,…,ℓ. The n-fold convolution f∗n of f is a probability vector over the numbers 0,…,nℓ, and these can be partitioned into congruence classes modulo d. The main result of this paper is that, asymptotically in n, these d congruence classes have equiprobability 1/d. In the motivating application, one has N containers of capacity d and repeatedly retrieves one item from each of M randomly selected containers (0
Volume (Year): 82 (2012)
Issue (Month): 10 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description |
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:82:y:2012:i:10:p:1849-1852. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.