Generating a random signed permutation with random reversals

DOI10.1007/s10959-005-7532-4zbMath1087.60014OpenAlexW2095245034MaRDI QIDQ2576806

Clyde H. jun. Schoolfield

Publication date: 14 December 2005

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10959-005-7532-4

zbMATH Keywords

Fourier transformMarkov chainrandom walkwreath productcomparison techniqueconvergence to the uniform distributiongenome modeling, hyperoctahedral group

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items

Total variation cutoff for the flip-transpose top with random shuffle

Cites Work

• Comparison techniques for random walk on finite groups
• Shuffling chromosomes
• Random walks on wreath products of groups
• Generating a random permutation with random transpositions
• Genome Rearrangements and Sorting by Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals