Exchangeable Random Ordered Trees by Positive Definite Functions

被引:0
作者
Ulrich Hirth
机构
[1] Universität der Bundeswehr München,Institute of Mathematics, Faculty of Aerospace Engineering 1
来源
Journal of Theoretical Probability | 2003年 / 16卷
关键词
semigroups; random trees; positive definite functions;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:339 / 344
页数:5
相关论文
共 6 条
[1]  
Hirth U.(1999)Random partitions by semigroup methods Semigroup Forum 59 126-140
[2]  
Ressel P.(2000)Exchangeable random orders and almost uniform distributions J. Theoret. Probab. 13 609-634
[3]  
Hirth U.(1988)Integral representations for distributions of symmetric stochastic processes Probab. Theory Related Fields 79 451-467
[4]  
Ressel P.(1994)Non-homogeneous de Finetti-type theorems J. Theoret. Probab. 7 469-482
[5]  
Ressel P.(undefined)undefined undefined undefined undefined-undefined
[6]  
Ressel P.(undefined)undefined undefined undefined undefined-undefined