Random and exhaustive generation of permutations and cycles

Details Random and exhaustive generation of permutations and cycles Random and exhaustive generation of permutations and cycles

2007-02-25

arxiv.org/abs/math/0702753v1

Annals of Combinatorics 12 (2009), 509-520

Mathematics

Combinatorics

9 pages

Scientific paper

10.1007/s00026-009-0003-3

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.

Affiliated with

Also associated with

No associations

Rating

Random and exhaustive generation of permutations and cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random and exhaustive generation of permutations and cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random and exhaustive generation of permutations and cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131674