Goldschmidt, C. (Christina), Martin, James B. and Spanò, Dario (2008) Fragmenting random permutations. Electronic communications in probability, Vol.13 (No.44). pp. 461-474.

Preview

PDF WRAP_Goldschmidt08-15w.pdf - Published Version - Requires a PDF viewer. Download (408Kb)

Request Changes to record.

Abstract

Problem 1.5.7 from Pitman's Saint-Flour lecture notes [11]: Does there exist for each n a fragmentation process (Pi(n,k); 1 <= k <= 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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science > Statistics
Library of Congress Subject Headings (LCSH):	Permutations
Journal or Publication Title:	Electronic communications in probability
Publisher:	University of Washington. Dept. of Mathematics
ISSN:	1083-589X
Official Date:	14 August 2008
Dates:	Date Event 14 August 2008 Published
Date of first compliant deposit:	14 December 2015
Volume:	Vol.13
Number:	No.44
Number of Pages:	14
Page Range:	pp. 461-474
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Open Access
Funder:	Engineering and Physical Sciences Research Council (EPSRC)
Grant number:	EP/D065755/1 (EPSRC), GR/T21783/01 (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads