Skip to main content
SpringerLink
Log in

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

  • Published:
Russian Mathematics Aims and scope Submit manuscript

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 the 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 consider the case when the number of taken particles converges to infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kolchin, V. F. A Class of Limit Theorems for Conditional Distributions, Litov. Mat. Sb. 8, 53–63 (1968) [in Russian].

    MathSciNet  MATH  Google Scholar 

  2. Kolchin, V. F. Random Graphs (Cambridge University Press, Cambridge, 2009).

    MATH  Google Scholar 

  3. Timashev, A. N. Asymptotic Expansions in Probability Combinatorics (TVP, Moscow, 2011) [in Russian].

    Google Scholar 

  4. Timashev, A. N. Generalized Scheme of Allocation in Problems of Probabilistic Combinatorics (Akademiya, Moscow, 2011) [in Russian].

    Google Scholar 

  5. Pavlov, Yu. L. Random Forests (Karelian Scientific Center of the Russian Academy of Sciences, Petrozavodsk, 1996) [in Russian].

    MATH  Google Scholar 

  6. Chuprunov, A. N., Fazekas I. An Analogue of the Generalised Allocation Scheme: Limit Theorems for the Number of Cells Containing a Given Number of Particles, Discrete Math. Appl. 22, No. 1, 101–122 (2012).

  7. Chuprunov, A. N., Fazekas, I. An Analogue of the Generalised Allocation Scheme: Limit Theorems for the Maximum Cell Load, Discrete Math. Appl. 22, No. 3, 307–314 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  8. Khvorostyanskaya, E. V., Pavlov, Yu. L. Limit Distributions of the Maximum Filling of Cells in One Allocation Scheme, Europian Researcher 76, No. 6–1, 1019–1027 (2014).

    Google Scholar 

  9. Borovkov, A. A. Probability Theory (Nauka, Moscow, 1976; Gordon and Breach, Abingdon, Oxon, 1998).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan Federal University, ul. Kremlyovskaya 18, Kazan, 420008, Russia

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

Authors
  1. A. N. Chuprunov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Alsaied
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Alkhuzani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Chuprunov.

Additional information

Original Russian Text © A.N. Chuprunov, G. Alsaied, M. Alkhuzani, 2017, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2017, No. 7, pp. 94–100.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chuprunov, A.N., Alsaied, G. & Alkhuzani, M. On maximal quantity of particles of one color in analogs of multicolor urn schemes. Russ Math. 61, 83–88 (2017). https://doi.org/10.3103/S1066369X17070118

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X17070118

Keywords

Search

Navigation