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 us to study the 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1567-1585 |
| Number of pages | 19 |
| Journal | Duke Mathematical Journal |
| Volume | 162 |
| Issue number | 9 |
| DOIs | |
| State | Published - Jun 2013 |
All Science Journal Classification (ASJC) codes
- General Mathematics