Skip to main content
SpringerLink
Log in

The Probability of Successful Allocation of Particles in Cells (The General Case)

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

Let p nN be the probability of successful allocation of n groups of particles in N cells with the following assumptions: (a) each group contains m particles and has allocation as a general allocation scheme; (b) each cell contains at most r particles from the same group; (c) events connected with different groups are independent. We obtain an asymptotically exact bound of p nN as n,N →∞ such that n/N is bounded. Applications to problems in error-correcting coding are considered.

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.

Similar content being viewed by others

References

  1. F. G. Avkhadiev and A. N. Chuprunov, “The probability of a successful allocation of ball groups by boxes,” Lobachevskii J. Math., 25, 3–7 (2007).

    MathSciNet  MATH  Google Scholar 

  2. F. G. Avkhadiev, I. R. Kayumov, and A. N. Chuprunov, “An investigation of the probability of successful allocation of particles in cells by methods of complex analysis,” Tr. Mat. Tsentra im. N. I. Lobachevskogo, 19, 6–7 (2003).

    Google Scholar 

  3. A. N. Chuprunov and B. I. Khamdeev, “On the probability of error correction for antinoise coding when the number of errors belongs to a finite set,” Inform. Ee Prim., 3, No. 3, 52–59 (2009).

    Google Scholar 

  4. A. N. Chuprunov and B. I. Khamdeev, “On probability of correction of a random number of errors in an error-correcting coding,” Discrete Math. Appl., 20, No. 2, 179–190 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. N. Chuprunov and B. I. Khamdeev, “The probability of correcting errors by an antinoise coding method when the number of errors belongs to a random set,” Russ. Math., 54, No. 8, 67–73 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  6. V. F. Kolchin, Random Graphs, Cambridge Univ. Press (2009).

  7. V. F. Kolchin, B. A. Sevast’yanov, and V. P. Chistyakov, Random Allocations, Winston & Sons, Washington (1978).

    Google Scholar 

  8. F. A. Novikov, Discrete Mathematics for Computer Programmers [in Russian], Piter (2004).

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

    Google Scholar 

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

    Google Scholar 

  11. A. N. Timashev, Large Deviations in Probabilistic Combinatorics [in Russian], Akademiya, Moscow (2011).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan Federal University, 420008, Kazan, Russia

    I. R. Kayumov & A. N. Chuprunov

Authors
  1. I. R. Kayumov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. N. Chuprunov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. R. Kayumov.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 18, No. 5, pp. 119–128, 2013.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kayumov, I.R., Chuprunov, A.N. The Probability of Successful Allocation of Particles in Cells (The General Case). J Math Sci 209, 88–95 (2015). https://doi.org/10.1007/s10958-015-2486-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-015-2486-2

Keywords

Search

Navigation