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...
Main Authors: | Goldschmidt, C, Martin, J, Spanò, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2007
|
Similar Items
-
Coagulation--fragmentation duality, Poisson--Dirichlet distributions and
random recursive trees
by: Dong, R, et al.
Published: (2005) -
Dual random fragmentation and coagulation and an application to the genealogy of Yule processes
by: Bertoin, J, et al.
Published: (2004) -
Randomness and permutations in coordinate descent methods
by: Gürbüzbalaban, Mert, et al.
Published: (2021) -
Decomposing random permutations into order-isomorphic subpermutations
by: Groenland, C, et al.
Published: (2023) -
Pattern Avoidance for Random Permutations
by: Harry Crane, et al.
Published: (2018-12-01)