Limit Poisson law for the distribution of the number of components in generalized allocation scheme

References

[1] Kolchin V. F., Random mappings, Optimization Software Inc. Publications Division, New York, 1986, 207 pp.Search in Google Scholar

[2] Bender E.A., "Asymptotic methods in enumeration", SIAM Review, 18:4 (1974), 485–515.10.1137/1016082Search in Google Scholar

[3] Goncharov V., "On the field of combinatorial analysis", Amer. Math. Soc. Transl., 19:2 (1962), 1–46.Search in Google Scholar

[4] Timashev A. N., The distributions of power series types and a generalized allocation scheme, M.: Izd. dom «Akademiya», 2016 (in Russian).Search in Google Scholar

[5] Kolchin V. F., "On the number of permutations with constraints on their cycle lengths", Discrete Math. Appl., 1:2 (1991), 179–193.10.1515/dma.1991.1.2.179Search in Google Scholar

[6] Pavlov A. I., "Local limit theorems for the number of components of random permutations and mappings", Theory Probab. Appl., 33:1 (1989), 183–187.10.1137/1133026Search in Google Scholar

[7] Pavlov A. I., "On the number of permutations with cycle lengths from a given set", Discrete Math. Appl., 2:4 (1992), 445–459.10.1515/dma.1992.2.4.445Search in Google Scholar

[8] Pavlov Yu. L., "Random mappings with constraints on the number of cycles", Proc. Steklov Inst. Math., 177 (1988), 131–142.Search in Google Scholar

[9] Timashev A. N., "Limit theorems for allocation of particles over different cells with restrictions to the size of the cells", Theory Probab. Appl., 49:4 (2005), 659–670.10.1137/S0040585X97981329Search in Google Scholar

[10] Yakymiv A. L., "On the number of A-permutations", Math. USSR-Sb., 66:1 (1990), 301–311.10.1070/SM1990v066n01ABEH001174Search in Google Scholar

[11] Yakymiv A. L., "Substitutions with cycle lengths from a fixed set", Discrete Math. Appl., 1:1 (1991), 105–116.10.1515/dma.1991.1.1.105Search in Google Scholar

[12] Yakymiv A. L., "Some classes of substitutions with cycle lengths from a given set", Discrete Math. Appl., 3:2 (1993), 213–220.10.1515/dma.1993.3.2.213Search in Google Scholar

[13] Yakimiv A. L., "Probabilistic applications of Tauberian theorems", Modern Probability and Statistics, VSP, Leiden, 2005, 225 pp.10.1515/9783110195293Search in Google Scholar

[14] Renyi A., "Some remarks on the theory of trees", Magyar. tud. Akad. Mat. Kutató Int. közl 4:7 (1959), 73–83.Search in Google Scholar

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

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

[17] Graham R. L., Knuth D. E., Patashnik O., Concrete Mathematics, Addison-Wesley, 1994, 656 pp.Search in Google Scholar