On maximal quantity of particles of one color in analogs of multicolor urn schemes

DOI10.3103/S1066369X17070118zbMATH Open1382.60019MaRDI QIDQ682334FDOQ682334

Authors: G. Alsaied, M. Alkhuzani, Alexey Chuprunov 

Publication date: 14 February 2018

Published in: Russian Mathematics (Search for Journal in Brave)

Recommendations

• On the number of colored balls from a fixed set in a multi-color urn scheme without return
• Central limit theorems for multicolor urns with dominated colors
• Strong convergence of infinite color balanced urns under uniform ergodicity
• Multicolor urn models with reducible replacement matrices
• Rates of convergence for balanced irreducible two-color Pólya urns

zbMATH Keywords

limit theoremallocation of particles to cellsbinomial random variablePoisson random variableurn scheme

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
• Title not available (Why is that?)
• Title not available (Why is that?)
• An analogue of the generalised allocation scheme: limit theorems for the maximum cell load

Cited In (2)

• On the number of colored balls from a fixed set in a multi-color urn scheme without return
• Multicolor containers, extremal entropy, and counting

This page was built for publication: On maximal quantity of particles of one color in analogs of multicolor urn schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682334)