Abstract

We introduce and study multiple partition structures which are sequences of probability measures on families of Young diagrams subjected to a consistency condition. The multiple partition structures are generalizations of Kingman's partition structures, and are motivated by a problem of population genetics. They are related to harmonic functions and coherent systems of probability measures on a certain branching graph. The vertices of this graph are multiple Young diagrams (or multiple partitions), and the edges depend on the Jack parameter. If the value of the Jack parameter is equal to one the branching graph under considerations reflects the branching rule for the irreducible representations of the wreath product of a finite group with the symmetric group. If the value of the Jack parameter is zero then the coherent systems of probability measures are precisely the multiple partition structures. We establish a bijective correspondence between the set of harmonic functions on the graph and probability measures on the generalized Thoma set. The correspondence is determined by a canonical integral representation of harmonic functions. As a consequence we obtain a representation theorem for multiple partition structures.We give an example of a multiple partition structure which is expected to be relevant for a model of population genetics for the genetic variation of a sample of gametes from a large population. Namely, we construct a probability measure on the wreath product of a finite group with the symmetric group. If the finite group contains the identity element only then it coincides with the well-known Ewens probability measure on the symmetric group. The constructed probability measure defines a multiple partition structure which is a generalization of the Ewens partition structure studied by Kingman. We show that this multiple partition structure can be represented in terms of a multiple analogue of the Poisson-Dirichlet distribution called the multiple Poisson-Dirichlet distribution in the paper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.