The Annals of Probability

The representation of composition structures

Alexander V. Gnedin

Full-text: Open access

Abstract

A composition structure is a sequence of consistent probability distributions for compositions (ordered partitions) of $n = 1, 2, \dots$. Any composition structure can be associated with an exchangeable random composition of the set of natural numbers. Following Donnelly and Joyce, we study the problem of characterizing a generic composition structure as a convex mixture of the "extreme" ones. We topologize the family $\mathscr{U}$ of open subsets of [0, 1] so that $\mathscr{U}$ becomes compact and show that $\mathscr{U}$ is homeomorphic to the set of extreme composition structures. The general composition struc-ture is related to a random element of $\mathscr{U}$ via a construction introduced by J. Pitman.

Article information

Source
Ann. Probab. Volume 25, Number 3 (1997), 1437-1450.

Dates
First available in Project Euclid: 18 June 2002

Permanent link to this document
https://projecteuclid.org/euclid.aop/1024404519

Digital Object Identifier
doi:10.1214/aop/1024404519

Mathematical Reviews number (MathSciNet)
MR1457625

Zentralblatt MATH identifier
0895.60037

Subjects
Primary: 60G09: Exchangeability
Secondary: 60C05: Combinatorial probability 60J50: Boundary theory

Keywords
Composition structure partition structure exchangeability paintbox process random set

Citation

Gnedin, Alexander V. The representation of composition structures. Ann. Probab. 25 (1997), no. 3, 1437--1450. doi:10.1214/aop/1024404519. https://projecteuclid.org/euclid.aop/1024404519


Export citation

References

  • [1] Aldous, D. J. (1985). Exchangeability and related topics. Lecture Notes in Math. 1117 1- 198. Springer, Berlin.
  • [2] Andrews, G. E. (1976). The Theory of Partitions. Addison-Wesley, Reading, MA.
  • [3] Baryshnikov, Y., Eisenberg, B. and Stengle, G. (1995). A necessary and sufficient condition for the existence of the limiting probability of a tie for the first place. Statist. Probab. Lett. 23 211-220.
  • [4] Donnelly, P. and Joyce, P. (1991). Consistent ordered sampling distributions: characterization and convergence. Adv. in Appl. Probab. 23 229-258.
  • [5] Kerov, S. V. (1989). Combinatorial examples in the theory of AF-algebras. In Zapiski Nauchnych Seminarov LOMI 172 55-67. Nauka, Leningrad. (In Russian.)
  • [6] Kerov, S. V. (1995). Subordinators and permutation actions with a quasi-invariant measure. In Zapiski Nauchnych Seminarov POMI 223 181-218. Nauka, Sankt Petersburg. (In Russian.)
  • [7] Kerov, S. V. and Vershik, A. M. (1981). Asymptotic theory of characters of the symmetric group. Functional Anal. Appl. 15 246-255.
  • [8] Kingman, J. F. C. (1978). The representation of partition structures. J. London Math. Soc. 18 374-380.
  • [9] Kingman, J. F. C. (1982). The coalescent. Stochastic Process. Appl. 13 235-248.
  • [10] Pitman, J. (1995). Partition structures derived from Brownian motion and stable subordinators. Bernoulli. To appear.
  • [11] Pitman, J. (1995). Exchangeable and partially exchangeable random partitions. Probab. Theory Related Fields 102 145-158.
  • [12] Vershik, A. (1995). Asymptotic combinatorics and algebraic analysis. In Proceedings of the International Congress on Mathematics, 1994, August 3-11, Z ¨urich 1384-1394. Birkh¨auser, Basel.