Fragmenting random permutations

Simple item page
dc.creatorGoldschmidt, Christina
dc.creatorMartin, James B.
dc.creatorSpanò, Dario
dc.date2007-12-04
dc.date.accessioned2026-07-07T08:47:16Z
dc.date.available2026-07-07T08:47:16Z
dc.descriptionProblem 1.5.7 from Pitman's Saint-Flour lecture notes: Does there exist for each n a fragmentation process (Π_{n,k}, 1 \leq k \leq n) taking values in the space of partitions of {1,2,...,n} such that Π_{n,k} is distributed like the partition generated by cycles of a uniform random permutation of {1,2,...,n} conditioned to have k cycles? We show that the answer is yes. We also give a partial extension to general exchangeable Gibbs partitions.
dc.description13 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0712.0556
dc.identifierhttp://arxiv.org/abs/0712.0556
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143536
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60C05, 05A18
dc.titleFragmenting random permutations
dc.typetext

Files

Collections

arXiv