Fragmenting random permutations

Problem 1.5.7 from Pitman's Saint-Flour lecture notes: Does there exist for each n a fragmentation process (\Pi_{n,k}, 1 \leq k \leq n) taking values in the space of partitions of {1,2,...,n} such that \Pi_{n,k} is distributed like the partition generated by cycles of a uniform random permutati...

Full description

Bibliographic Details
Main Authors: Goldschmidt, C, Martin, J, Spanò, D
Format: Journal article
Language:English
Published: 2007