scientific article; zbMATH DE number 4038892

From MaRDI portal
Publication:3777142





Let \(\zeta_ n\) denote the number of cycles of a permutation chosen with probability 1/n! among all permutations of \(\{\) 1,...,n\(\}\) and let \(\lambda_ n\) denote the number of connected components of a mapping of \(\{\) 1,...,n\(\}\) into itself chosen with probability \(n^{-n}\) among all such mappings. Local limit theorems for \(\Pr ob.\{\zeta_ n=m\}\) and \(\Pr ob.\{\lambda_ n=m_ 1\}\) are proved, as \(n\to \infty\), where \[ m=\log n+x(\log n)^{1/2},\quad m_ 1=(1/2)\log n+x((1/2)\log n)^{1/2}\quad and\quad x=o((\log n)^{1/2}). \] These results generalize the known local limit theorems for \(\zeta_ n\) and \(\lambda_ n\) obtained by \textit{V. F. Kolchin} [Teor. Veroyatn. Primen. 16, 67-82 (1971; Zbl 0239.60014); English translation in Theory Probab. Appl. 16, 74-90 (1971); ibid. 21, 48-63 (1976; Zbl 0366.60015); English translation in Theory Probab. Appl. 21, 48-63 (1976)] for more restricted ranges of the values of x.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777142)