Random Cyclations

Electronic Journal Of Combinatorics

Nicholas Pippenger¹ 

关键词: Permutations;    Cycle lengths;    Asymptotics;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others