The probability of long cycles in interchange processes
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LQUYTE4Brecord.jsonopen to challenge →
classification
math.PR
math.RT
keywords
cycleslonginterchangepermutationprobabilityallowscasescharacters
read the original abstract
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the interchange process, including a precise formula for the probability that the permutation is one long cycle at a given time t, and estimates for the cases of shorter cycles.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.