Discrete limit laws for additive functions on the symmetric group
Eugenijus Manstavičius (2005)
Acta Mathematica Universitatis Ostraviensis
Similarity:
Inspired by probabilistic number theory, we establish necessary and sufficient conditions under which the numbers of cycles with lengths in arbitrary sets posses an asymptotic limit law. The approach can be extended to deal with the counts of components with the size constraints for other random combinatorial structures.