Limit Theorem for the General Number of Cycles in a Random A-Permutation
From MaRDI portal
Publication:3521331
DOI10.1137/S0040585X97982827zbMath1145.60008OpenAlexW2069462419MaRDI QIDQ3521331
Publication date: 21 August 2008
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0040585x97982827
Tauberian theoremregularly varying functionsslowly varying functionsrandom \(A\)-permutationsasymptotic density of the set \(A\)general number of cycles in random \(A\)-permutationlogarithmic density of the set \(A\)
Central limit and other weak theorems (60F05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Related Items
Generalized Poisson--Dirichlet Distributions Based on the Dickman Subordinator, Random permutations without macroscopic cycles, The number of cycles in random permutations without long cycles is asymptotically Gaussian, A limit theorem for the logarithm of the order of a random A-permutation, Tauberian Theorem for Generating Functions of Multiple Series, On a Number of Components in a Random $A$-Mapping