Fragmenting random permutations

Details Fragmenting random permutations Fragmenting random permutations

2007-12-04

arxiv.org/abs/0712.0556v1

Mathematics

Probability

13 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fragmenting random permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fragmenting random permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fragmenting random permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682154