On random mappings with restrictions on sizes of components

References

[1] Arratia R., Barbour A. D., Tavare S., Logarithmic Combinatorial Structures: A Probabilistic Approach, European Mathematical Society, 2003, 363 pp.10.4171/000Suche in Google Scholar

[2] Bolotnikov Yu. V., Sachkov V. N., Tarakanov V. E., “On some classes of random variables on cycles of permutations”, Math. USSR-Sb., 361 (1980), 87–99.10.1070/SM1980v036n01ABEH001771Suche in Google Scholar

[3] Bender E. A., “Asymptotic methods in enumeration”, SIAM Review, 164 (1974), 485–515.10.1137/1016082Suche in Google Scholar

[4] Bingham N. H., Goldie Ch. M., Teugels J. L., Regular Variation, Cambridge University Press, 1987, 494 pp.10.1017/CBO9780511721434Suche in Google Scholar

[5] Goncharov V. L., “On the field of combinatory analysis”, Amer. Math. Soc. Transl., 19 (1962), 1–46.Suche in Google Scholar

[6] Hansen J. C., “A functional central limit theorem for random mappings”, Ann. Probab, 171 (1989), 317–332.10.1214/aop/1176991511Suche in Google Scholar

[7] Harris B., “A survey of the early history of the theory of random mappings”, Progr. Pure Appl. Discrete Math., Probabilistic methods in discrete mathematics (Petrozavodsk, 1992), 1 Utrecht: VSP, 1993, 1–22.10.1515/9783112318980-002Suche in Google Scholar

[8] Ivchenko G. I., Medvedev Yu. I., “Random combinatorial objects”, Doklady Mathematics, 693 (2004), 344–347.Suche in Google Scholar

[9] Ivchenko G. I., Medvedev Yu. I., “Random combinatorial objects in a general parametric model”, Tr. Diskr. Mat., 10 (2007), 73–86 (in Russian).Suche in Google Scholar

[10] Feller V., An introduction to probability theory and its applications. Volume II, Wiley, 1957, 704 pp.Suche in Google Scholar

[11] Karamata J., “Über die Hardy – Littelwoodsche Umkehrungen des Abelschen Steitigkeitssatzes”, Math. Z., 32 (1930), 319–320.10.1007/BF01194636Suche in Google Scholar

[12] Karamata J., “Neuer Beweis und Verallgemeinerung einiger Tauberian-Sätze”, Math. Z., 332 (1931), 294–299.10.1007/BF01174355Suche in Google Scholar

[13] Kolchin V. F., Random Mappings, Optimization Software Inc. Publications Division, New York, 1986, 207 pp.Suche in Google Scholar

[14] Kolchin V. F., Random Graphs, Cambridge University Press, 1998, 268 pp.10.1017/CBO9780511721342Suche in Google Scholar

[15] Manstavićius E., “Total variation approximation and a functional limit theorem”, Monatsh. Math., 161 (2010), 313–334.10.1007/s00605-009-0151-xSuche in Google Scholar

[16] Manstavićius E., “On total variation approximations for random assemblies”, AofA’12, Discrete Math. & Theoretical Computer Sci., AQ 97–108.Suche in Google Scholar

[17] Pavlov A. I., “On the number of permutations with cycle lengths in a given setx‘”, Discrete Math. Appl., 24 (1992), 445–459.Suche in Google Scholar

[18] Postnikov A. G., Introduction to Analytic Number Theory, American Mathematical Soc., 1988, 320 pp.Suche in Google Scholar

[19] Sachkov V. N., “Mappings of a finite set with limitations on contours and height”, Theory Probab. Appl., 174 (1973), 640–656.10.1137/1117077Suche in Google Scholar

[20] Sachkov V. N., Probabilistic Methods in Combinatorial Analysis, Encyclopedia of Mathematics and its Applications, Cambridge University Press, 1997, 256 pp.Suche in Google Scholar

[21] Sachkov V. N., Introduction to the combinatorial methods of discrete mathematics, MCCME, Moscow, 2004 (in Russian), 424 pp.Suche in Google Scholar

[22] Timashev A. N., Generalized scheme of allocation in problems of probabilistic combinatorics, M.: Akademiya, 2011 (in Russian), 268 pp.Suche in Google Scholar

[23] Timashev A. N., Large deviations in probabilistic combinatorics, M.: Akademiya, 2011 (in Russian), 248 pp.Suche in Google Scholar

[24] Timashev A. N., Asymptotic expansions in probabilistic combinatorics, M.: TVP, 2011 (in Russian), 312 pp.Suche in Google Scholar

[25] Timashev A. N., Additive problems with constraints on the values of the terms, M.: Akademiya, 2015 (in Russian), 184 pp.Suche in Google Scholar

[26] Timashev A. N., Power series type distributions and generalized allocation scheme, M.: Akademiya, 2016 (in Russian), 168 pp.Suche in Google Scholar

[27] Timashev A. N., “Random permutations with prime lengths of cycles”, Theory Probab. Appl., 612 (2017), 309–320.10.1137/S0040585X97T988162Suche in Google Scholar

[28] Timashev A. N., Random components in a generalized allocation scheme, M.: Akademiya, 2017 (in Russian), 120 pp.Suche in Google Scholar

[29] Timashev A. N., “Random mappings with component sizes from a given set”, Theory Probab. Appl., 643 (2019), 481–489.10.1137/S0040585X97T989647Suche in Google Scholar

[30] Yakymiv A. L., Probabilistic applications of Tauberian theorems, M.: Fizmatlit, 2005 (in Russian), 256 pp.10.1515/9783110195293Suche in Google Scholar

[31] Yakymiv A. L., “On the number of cyclic points of random A-mapping”, Discrete Math. Appl., 235-6 (2013), 503–515.Suche in Google Scholar

[32] Yakymiv A. L., “On the order of random permutation with cycle weights”, Theory Probab. Appl., 632 (2018), 209–226.10.1137/S0040585X97T989015Suche in Google Scholar

[33] Yakymiv A. L., “Variance of the number of cycles of random A-permutation”, Discrete Math. Appl., 321 (2022), 59–68.10.1515/dma-2022-0005Suche in Google Scholar

[34] Yakymiv A. L., “Local limit theorem for the multiple power series distributions”, Mathematics, 82067 (2020), 8 pp.10.3390/math8112067Suche in Google Scholar

[35] Yakymiv A. L., “Moment characteristics of a random mapping with restrictions on component sizes”, Proc. Steklov Inst. Math., 316 (2022), 356–369.10.1134/S0081543822010242Suche in Google Scholar

[36] Yakymiv A. L., “Random mappings with constraints on the cycle lengths”, J. Math. Sci. (N.Y.), 2672 (2022), 228–233.10.1007/s10958-022-06128-9Suche in Google Scholar