Skip to main content
Log in

Random Mappings with Constraints on the Cycle Lengths

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

In this article, we give a brief overview of limit theorems for random mappings with restrictions on the cycle lengths. Also, we formulate recent results in this field.

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

Access this article

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. R.Arratia, A.D. Barbour, and S.Tavare, Logarithmic Combinatorial Structures: a Probabilistic Approach, EMS, Zürich (2003).

  2. Yu.V.Bolotnikov, V.N. Sachkov, and V. E.Tarakanov, “On some classes of random variables on cycles of permutations,” Math. USSR-Sb., 36, No. 1, 87–99 (1980).

    Article  Google Scholar 

  3. P. J.Donnelly, W. J.Ewens, and S.Padmadisastra, “Functionals of random mappings: exact and asymptotic results,” Adv. Appl. Probab., 23, No. 3, 437–455 (1991).

    Article  MathSciNet  Google Scholar 

  4. G. I. Ivchenko, Yu. I.Medvedev, “On random permutations,” Procedings on Discrete Mathematics, 5, 73–92 (2002).

  5. G. I. Ivchenko, Yu. I.Medvedev, “The method of V. L. Goncharov and its development in the analysis of various models of random permutations,” Theor. Probab. Appl., 47, No. 3, 518–526 (2003).

    Article  MathSciNet  Google Scholar 

  6. V. L.Goncharov, “On the field of combinatory analysis,” Am. Math. Soc. Transl., 19, 1–46 (1962).

    MathSciNet  MATH  Google Scholar 

  7. J.Klimavičius, E.Manstavičius, “Turán–Kubilius’ inequality on permutations,” Ann. Univ. Sci. Bu-dapest. Sect. Comput, 48, 45–51 (2018).

    MATH  Google Scholar 

  8. E.Manstavičius, V. Stepas, “Variance of additive functions defined on random assemblies,” Lith. Math. J., 57, No. 2, 222–235 (2017).

    Article  MathSciNet  Google Scholar 

  9. V. F.Kolchin, Random Mappings, Optimization Software, New York (1986).

    MATH  Google Scholar 

  10. V. F.Kolchin, Random Graphs, Encyclopedia Math. Appl. 53, Cambridge Univ. Press, Cambridge (1999).

  11. A. I. Pavlov, “On two classes of permutations with number-theoretic conditions on the lengths of the cycles,” Math. Notes, 52, No. 6, 739–746 (1997).

    Article  Google Scholar 

  12. J. Kubilius, Probabilistic Methods in the Theory of Numbers, Amer. Math. Soc., Providence (1964).

    Book  Google Scholar 

  13. J. Kubilius, “On the estimate of the second central moment for arbitrary additive arithmetic functions,” Liet. Mat. Rink., 23, 110–117 (1983).

    Google Scholar 

  14. Yu. L. Pavlov, Random Forests, VSP, Utrecht (2000).

    Book  Google Scholar 

  15. V.N. Sachkov, “Mappings of a finite set with limitations on contours and height,” Theor. Probab. Appl., 17, No. 4, 640–656 (1972).

    Article  Google Scholar 

  16. V.N. Sachkov, Combinatorial Methods in Discrete Mathematics, Encyclopedia Math. Appl.,55, Cambridge Univ. Press (1996).

  17. V.N. Sachkov, Probabilistic Methods in Combinatorial Analysis, Encyclopedia Math. Appl.,56, Cambridge Univ. Press (1997).

  18. V.N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics, MCCME, Moscow (2004).

    Google Scholar 

  19. A.N.Timashev, Generalized Allocation Scheme in Problems of Probabilistic Combinatorics, Akademiya, Moscow (2011).

    Google Scholar 

  20. A.N.Timashev, Large Deviations in Probabilistic Combinatorics, Akademiya, Moscow (2011).

    Google Scholar 

  21. A.N.Timashev, Asymptotic Expansions in Probabilistic Combinatorics, TVP, Moscow (2011).

    Google Scholar 

  22. A.N.Timashev, Additive Problems with Constraints on the Values of Terms, Akademiya, Moscow (2015).

    Google Scholar 

  23. P. Turán,, “Uber einige Verallgemeinerungen eines Satzes von Hardy und Ramanujan,” J. London Math. Soc., 11, No. 2, 125–133 (1936).

    Article  MathSciNet  Google Scholar 

  24. A. L.Yakymiv, Probabilistic Applications of Tauberian Theorems, VSP, Boston (2005).

    Book  Google Scholar 

  25. A. L.Yakymiv, “On the distribution of the mth maximal cycle lengths of random A-permutations,” Discrete Math. Appl., 15, No. 3, 527–546 (2005).

    Article  MathSciNet  Google Scholar 

  26. A. L.Yakymiv, “A limit theorem for the logarithm of the order in a random A-permutation,” Discrete Math. Appl., 20, No. 1, 247–275 (2010).

    MathSciNet  MATH  Google Scholar 

  27. A. L.Yakymiv, “On the number of cyclic points of random A-mapping,” Discrete Math. Appl., 23, No. 5, 247–275 (2010).

    MathSciNet  MATH  Google Scholar 

  28. A. L.Yakymiv, “Moment asymptotics for the cycle number of random A-permutation,” Diskret. Mat., 31, No. 3, 114–127 (2019).

    MathSciNet  Google Scholar 

  29. A. L.Yakymiv, “Size distribution of the largest component in a random A-mapping,” Diskret. Mat., 31, No. 4, 116–127 (2019).

    Google Scholar 

  30. A. L.Yakymiv, “Variance of the cycle number of random A-permutation,” Diskret. Mat., 32, No. 3, 135–146 (2019).

    Google Scholar 

  31. V.M. Zolotarev, “More exact statements of several theorems in the theory of branching processes,” Theor. Probab. Appl., 2, No. 2, 245–253 (1957).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. L. Yakymiv.

Additional information

Proceedings of the XXXVI International Seminar on Stability Problems for Stochastic Models, Petrozavodsk, Russia, 22–26 June, 2020. Part I.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yakymiv, A.L. Random Mappings with Constraints on the Cycle Lengths. J Math Sci 267, 228–233 (2022). https://doi.org/10.1007/s10958-022-06128-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-022-06128-9

Navigation