Size-biased and conditioned random splitting trees

被引:18
作者
Geiger, J
机构
[1] Fachbereich Mathematik, Universität Frankfurt, D-60054 Frankfurt am Main
关键词
random tree; Galton-Watson process; depth-first search; Poisson point process; size-biasing method; M/G/1-queue;
D O I
10.1016/S0304-4149(96)00108-1
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Random splitting trees share the striking independence properties of the continuous time binary Galton-Watson tree. They can be represented by Poisson point processes and their contour processes are strong Markov processes. Here we study splitting trees conditioned on extinction, respectively non-extinction as well as size-biased splitting trees. We give explicit probabilistic constructions of those trees by decomposing them into independent parts along a distinguished line of descent. The size-biased trees are shown to have stationary contour processes. Splitting trees are related to M/G/1-queuing systems which allows to translate the results on the trees into statements on the queues.
引用
收藏
页码:187 / 207
页数:21
相关论文
共 8 条
[1]  
ALDOUS D., 1991, London Math. Soc. Lecture Note Ser., V167, P23, DOI 10.1017/CBO9780511662980.003
[2]  
GEIGER J, 1996, CLASSICAL MODERN BRA, V84, P111
[3]  
GEIGER J, 1994, THESIS U FRANKFURT F
[4]  
GEIGER J, 1995, LONDON MATH SOC LECT, V216, P72
[5]  
GRIFFEATH D, 1978, ADV MATH SUPPLEMENTA, V2, P1
[6]  
LEGALL JF, 1989, LECT NOTES MATH, V1372, P258
[7]   CONCEPTUAL PROOFS OF L-LOG-L CRITERIA FOR MEAN-BEHAVIOR OF BRANCHING-PROCESSES [J].
LYONS, R ;
PEMANTLE, R ;
PERES, Y .
ANNALS OF PROBABILITY, 1995, 23 (03) :1125-1138
[8]  
NEVEU J, 1989, LECT NOTES MATH, V1372, P248