Probabilistic and fractal aspects of Levy trees

被引:143
|
作者
Duquesne, T
Le Gall, JF
机构
[1] Univ Paris 11, F-91405 Orsay, France
[2] Ecole Normale Super, DMA, F-75005 Paris, France
关键词
D O I
10.1007/s00440-004-0385-4
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We investigate the random continuous trees called Levy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the set of equivalence classes of compact rooted R-trees, which is equipped with the Gromov-Hausdorff distance. To construct Levy trees, we make use of the coding by the height process which was studied in detail in previous work. We then investigate various probabilistic properties of Levy trees. In particular we establish a branching property analogous to the well-known property for Galton-Watson trees: Conditionally given the tree below level a, the subtrees originating from that level are distributed as the atoms of a Poisson point measure whose intensity involves a local time measure supported on the vertices at distance a from the root. We study regularity properties of local times in the space variable, and prove that the support of local time is the full level set, except for certain exceptional values of a corresponding to local extinctions. We also compute several fractal dimensions of Levy trees, including Hausdorff and packing dimensions, in terms of lower and upper indices for the branching mechanism function psi which characterizes the distribution of the tree. We finally discuss some applications to super-Brownian motion with a general branching mechanism.
引用
收藏
页码:553 / 603
页数:51
相关论文
共 50 条
  • [31] COLLAPSE OF LOADED FRACTAL TREES
    TURCOTTE, DL
    SMALLEY, RF
    SOLLA, SA
    NATURE, 1985, 313 (6004) : 671 - 672
  • [32] Games characterizing Levy-Longo trees
    Ong, CHL
    Di Gianantonio, P
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 476 - 487
  • [33] Games characterizing Levy-Longo trees
    Ong, CHL
    Di Gianantonio, P
    THEORETICAL COMPUTER SCIENCE, 2004, 312 (01) : 121 - 142
  • [34] From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem
    Curry, Justin
    DeSha, Jordan
    Garin, Adelie
    Hess, Kathryn
    Kanari, Lida
    Mallery, Brendan
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 116
  • [35] Fractal aspects of hadrons
    Deppman, Airton
    Megias, Eugenio
    XLVI INTERNATIONAL SYMPOSIUM ON MULTIPARTICLE DYNAMICS (ISMD 2016), 2017, 141
  • [36] Paired Levy-Mandelbrot trajectory as a homogeneous fractal
    Uchaikin, V
    Gismjatov, I
    Gusarov, G
    Svetukhin, V
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 1998, 8 (05): : 977 - 984
  • [37] Probabilistic Distances Between Trees
    Garba, Maryam K.
    Nye, Tom M. W.
    Boys, Richard J.
    SYSTEMATIC BIOLOGY, 2018, 67 (02) : 320 - 327
  • [38] Probabilistic timed behavior trees
    Colvin, Robert
    Grunske, Lars
    Winter, Kirsten
    INTEGRATED FORMAL METHODS, PROCEEDINGS, 2007, 4591 : 156 - 175
  • [39] Probabilistic Lexicographic Preference Trees
    Liu, Xudong
    Truszczynski, Miroslaw
    ALGORITHMIC DECISION THEORY, ADT 2021, 2021, 13023 : 86 - 100
  • [40] STEINER TREES IN PROBABILISTIC NETWORKS
    WALD, JA
    COLBOURN, CJ
    MICROELECTRONICS RELIABILITY, 1983, 23 (05) : 837 - 840