Random cyclations

Publication date 14 August 2014

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

Full work available at URL https://arxiv.org/abs/math/0408031, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p9

zbMATH Keywords

asymptotics cycle lengths permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Abstract: Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and we investigate the distribution of these lengths. The distribution is similar to that of the distribution of the lengths of cycles in a random permutation, but it also exhibits some striking differences.

Review text

Summary: Consider \(n\) unit intervals, say \([1,2], [3,4], \ldots, [2n-1,2n]\). Identify their endpoints in pairs at random, with all \((2n-1)!! = (2n-1)(2n-3)\cdots 3\cdot 1\) pairings being equally likely. The result is a collection of cycles of various lengths, and we investigate the distribution of these lengths. The distribution is similar to that of the distribution of the lengths of cycles in a random permutation, but it also exhibits some striking differences.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Random cyclations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396919)