科研之友
微信
新浪微博
Facebook
分享链接
摘要
We give a new, simple construction of the alpha-stable tree for alpha is an element of (1; 2]. We obtain it as the closure of an increasing sequence of R-trees inductively built by gluing together line-segments one by one. The lengths of these line-segments are related to the the increments of an increasing R+-valued Markov chain. For alpha = 2, we recover Aldous' line-breaking construction of the Brownian continuum random tree based on an inhomogeneous Poisson process.
- 出版日期2015-2-24
