Search results for Mathematics

We investigate the limit distributions associated with cost measures in Sattolo's algorithm for generating random cyclic permutations. The number of moves made by an element turns out to be a mixture of 1 and 1 plus a geometric distribution with parameter ½, where the mixing probability is the limiting ratio of the rank of the element being moved to the size of the permutation. On the other hand, the raw distance traveled by an element to its final destination does not converge in distribution without norming. Linearly scaled, the distance converges to a mixture of a uniform and a shifted product of a pair of independent uniforms. The results are obtained via randomization as a transform, followed by derandomization as an inverse transform. The work extends analysis by Prodinger.

68Wxx

Refine listing

Refine listing

Actions for selected content:

81 results in 68Wxx

Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization

68Wxx

Refine listing

Refine listing

Actions for selected content:

Save Search

81 results in 68Wxx

Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization