Random cyclations (Q396919): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / 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. | |||
| Property / 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6330340 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
permutations | |||
| Property / zbMATH Keywords: permutations / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle lengths | |||
| Property / zbMATH Keywords: cycle lengths / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
asymptotics | |||
| Property / zbMATH Keywords: asymptotics / rank | |||
Normal rank | |||
Revision as of 15:30, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
