Joint Probabilities within Random Permutations
From MaRDI portal
Permutations, words, matrices (05A05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Population dynamics (general) (92D25) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Other combinatorial number theory (11B75) Recurrences (11B37) Evaluation of number-theoretic constants (11Y60)
Abstract: A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random permutations. We offer a survey of practical methods for computing relevant probabilities of a bivariate or trivariate flavor.
This page was built for publication: Joint Probabilities within Random Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394222)
