The sequential occupancy problem through group throwing of indistinguishable balls

DOI10.1007/s11009-009-9161-3zbMath1223.60010OpenAlexW2063369019MaRDI QIDQ539526

Tamar Gadrich, Rachel Ravid

Publication date: 30 May 2011

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-009-9161-3

zbMATH Keywords

waiting timeBose-Einstein statisticsgroup throwingindistinguishable itemsoccupancy problemrecursive generating functions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (2)

EXCHANGEABLE OCCUPANCY MODELS AND DISCRETE PROCESSES WITH THE GENERALIZED UNIFORM ORDER STATISTICS PROPERTY ⋮ On homogeneous multivariate distributions in random occupancy models and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Poisson approximation in an urn model with indistinguishable balls
• Refined large deviation asymptotics for the classical occupancy problem
• On the number of overflown urns and excess balls in an allocation model with limited urn capacity
• A survey of the coupon collector's problem with random sample sizes
• Distributions of random partitions and their applications
• The coupon subset collection problem
• Normal approximation in an urn model with indistinguishable balls
• The collector's problem with group drawings
• Some limit theorems in urn models with indistinguishable balls
• Combinatorial Methods in Discrete Distributions

This page was built for publication: The sequential occupancy problem through group throwing of indistinguishable balls