Regenerative partition structures
From MaRDI portal
Publication:1773151
zbMATH Open1078.60009arXivmath/0408071MaRDI QIDQ1773151FDOQ1773151
Authors: Alexander Gnedin, Jim Pitman 
Publication date: 25 April 2005
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We consider Kingman's partition structures which are regenerative with respect to a general operation of random deletion of some part. Prototypes of this class are the Ewens partition structures which Kingman characterised by regeneration after deletion of a part chosen by size-biased sampling. We associate each regenerative partition structure with a corresponding regenerative composition structure, which (as we showed in a previous paper) can be associated in turn with a regenerative random subset of the positive halfline, that is the closed range of a subordinator. A general regenerative partition structure is thus represented in terms of the Laplace exponent of an associated subordinator. We also analyse deletion properties characteristic of the two-parameter family of partition structures.
Full work available at URL: https://arxiv.org/abs/math/0408071
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Recursive partition structures
- Partitions of partitions
- scientific article; zbMATH DE number 33706
- Reconstruction of partitions
- Regenerative composition structures
- Generating irregular partitionable data structures
- Recursive partitioning and applications
- scientific article; zbMATH DE number 4080653
- Efficient reconstruction of partitions
- Recursive generation of partitionable graphs
Cited In (18)
- Regenerative compositions in the case of slow variation
- Title not available (Why is that?)
- Regeneration in random combinatorial structures
- Two-parameter family of infinite-dimensional diffusions on the Kingman simplex
- A reversible allelic partition process and Pitman sampling formula
- Coherent random permutations with biased record statistics
- Random assignment processes: strong law of large numbers and de Finetti theorem
- Asymptotic laws for compositions derived from transformed subordinators
- Recursive partition structures
- Fragmenting random permutations
- Stick-breaking processes, clumping, and Markov chain occupation laws
- Excheangable partitions derived from Markovian coalescents
- Regenerative composition structures
- Asymptotic laws for regenerative compositions: gamma subordinators and the like
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- Title not available (Why is that?)
- Ordered and size-biased frequencies in GEM and Gibbs' models for species sampling
- Binary sequential representations of random partitions
This page was built for publication: Regenerative partition structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773151)
