RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2017 Number 7, Pages 94–100 (Mi ivm9263)

This article is cited in 1 paper

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

A. N. Chuprunov, G. Alsaied, M. Alkhuzani

Kazan Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia

Abstract: We deal with analogs of multicolor urn schemes such that the number of particles is not more than a given number. We introduce conditions which provide the convergence of random variables which is the maximal number of taken particles of a same color to a random variable that has values zero and one. We prove this convergence in the case when a number of taken particles is not more than a fixed number and number of colors converges to infinity. We also consder the case when the number of taken particles converges to infinity.

Keywords: allocation of particles to cells, urn scheme, Pousson random variable, binomial random variable, limit theorem.

UDC: 519.212

Received: 02.03.2016


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2017, 61:7, 83–88

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024