Fragmenting random permutations

DOI10.1214/ECP.V13-1402MaRDI QIDQ1038904zbMATH OpenOpenAlexFDO

Authors Christina Goldschmidt, James Martin, Dario Spanò

Publication date 20 November 2009

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.0556, https://eudml.org/doc/231308, http://www.emis.de/journals/EJP-ECP/_ejpecp/ECP/viewarticle1bea.html

zbMATH Keywords

random permutationfragmentation processGibbs partitionchinese restaurant process

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of partitions of integers (05A17)

Abstract: 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 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.

Recommendations

• scientific article; zbMATH DE number 3844715
• Gibbs distributions for random partitions generated by a fragmentation process
• Regenerative partition structures
• Fragmentation of ordered partitions and intervals
• Random partition of a finite set by cycles of permutation

Cited in

(7)

• scientific article; zbMATH DE number 4218652 (Why is no real title available?)
• Fragmentation of ordered partitions and intervals
• Alpha-diversity processes and normalized inverse-Gaussian diffusions
• Random permutations of countable sets
• On time dynamics of coagulation-fragmentation processes
• Efron's monotonicity property for measures on \(\mathbb{R}^2\)
• Coagulation Processes with Gibbsian Time Evolution

This page was built for publication: Fragmenting random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038904)