Skip to main content
Log in

Exchangeable Random Ordered Trees by Positive Definite Functions

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

We prove that the set of exchangeable random totally ordered trees is a Bauer simplex whose extreme points are the generalized paint-box processes. The method is based on semigroups, analogous to Hirth and Ressel,(2, 3) and is readily also applied to inverse trees.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Berg, C., Christensen, J. P. R., and Ressel, P. (1984). Harmonic Analysis on Semigroups, Springer-Verlag, Berlin/Heidelberg/New York.

    Google Scholar 

  2. Hirth, U., and Ressel, P. (1999). Random partitions by semigroup methods. Semigroup Forum 59(1), 126–140.

    Google Scholar 

  3. Hirth, U., and Ressel, P. (2000). Exchangeable random orders and almost uniform distributions. J. Theoret. Probab. 13(3), 609–634.

    Google Scholar 

  4. Ressel, P. (1988). Integral representations for distributions of symmetric stochastic processes. Probab. Theory Related Fields 79, 451–467.

    Google Scholar 

  5. Ressel, P. (1994). Non-homogeneous de Finetti-type theorems. J. Theoret. Probab. 7, 469–482.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hirth, U. Exchangeable Random Ordered Trees by Positive Definite Functions. Journal of Theoretical Probability 16, 339–344 (2003). https://doi.org/10.1023/A:1023514425845

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023514425845

Navigation