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.
Similar content being viewed by others
REFERENCES
Berg, C., Christensen, J. P. R., and Ressel, P. (1984). Harmonic Analysis on Semigroups, Springer-Verlag, Berlin/Heidelberg/New York.
Hirth, U., and Ressel, P. (1999). Random partitions by semigroup methods. Semigroup Forum 59(1), 126–140.
Hirth, U., and Ressel, P. (2000). Exchangeable random orders and almost uniform distributions. J. Theoret. Probab. 13(3), 609–634.
Ressel, P. (1988). Integral representations for distributions of symmetric stochastic processes. Probab. Theory Related Fields 79, 451–467.
Ressel, P. (1994). Non-homogeneous de Finetti-type theorems. J. Theoret. Probab. 7, 469–482.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1023514425845