Random cyclations (Q396919)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random cyclations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random cyclations |
scientific article |
Statements
Random cyclations (English)
0 references
14 August 2014
0 references
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.
0 references
permutations
0 references
cycle lengths
0 references
asymptotics
0 references
0.7267518043518066
0 references
0.7245087027549744
0 references
0.7156105041503906
0 references
