Preserving the number of cycles of length \(k\) in a growing uniform permutation

zbMath1351.05126MaRDI QIDQ727199

Philippe Duchon, Romaric Duvignau

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p22

zbMATH Keywords

random generationrandom permutations\(k\)-cycles in permutationsgeneration tree

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cycle structure of random permutations
• Another interpretation of the number of derangements
• On the Eigenvalues of Random Matrices
• Generating Random Derangements
• Local Update Algorithms for Random Graphs

This page was built for publication: Preserving the number of cycles of length \(k\) in a growing uniform permutation