Random cyclations
| dc.creator | Pippenger, Nicholas | |
| dc.date | 2004-08-03 | |
| dc.date.accessioned | 2026-07-07T05:10:57Z | |
| dc.date.available | 2026-07-07T05:10:57Z | |
| dc.description | 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. | |
| dc.description | i+19 pp | |
| dc.identifier | https://arxiv.org/abs/math/0408031 | |
| dc.identifier | http://arxiv.org/abs/math/0408031 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72090 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05 | |
| dc.title | Random cyclations | |
| dc.type | text |