We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a two-parameter Poisson–Dirichlet family of continuous fragmentation trees, including the stable trees of Duquesne and Le Gall, the fine partition is obtained from the coarse one by shattering each of its parts independently, according to the same law. As a second application of spinal decompositions, we prove that among the continuous fragmentation trees, stable trees are the only ones whose distribution is invariant under uniform re-rooting.
References
[1] Aldous, D. (1991). The continuum random tree. I. Ann. Probab. 19 1–28.
[2] Aldous, D. (1991). The continuum random tree. II. An overview. In Stochastic Analysis (Durham, 1990). London Mathematical Society Lecture Note Series 167 23–70. Cambridge Univ. Press, Cambridge.
[3] Aldous, D. (1993). The continuum random tree. III. Ann. Probab. 21 248–289.
[4] Aldous, D. (1996). Probability distributions on cladograms. In Random Discrete Structures (Minneapolis, MN, 1993). IMA Vol. Math. Appl. 76 1–18. Springer, New York.
[5] Aldous, D., Miermont, G. and Pitman, J. (2004). Brownian bridge asymptotics for random p-mappings. Electron. J. Probab. 9 37–56 (electronic).
[6] Aldous, D. and Pitman, J. (1998). Tree-valued Markov chains derived from Galton–Watson processes. Ann. Inst. H. Poincaré Probab. Statist. 34 637–686.
[7] Basdevant, A.-L. (2006). Ruelle’s probability cascades seen as a fragmentation process. Markov Process. Related Fields 12 447–474.
[8] Bertoin, J. (2001). Homogeneous fragmentation processes. Probab. Theory Related Fields 121 301–318.
[9] Bertoin, J. (2002). Self-similar fragmentations. Ann. Inst. H. Poincaré Probab. Statist. 38 319–340.
[10] Bertoin, J. (2006). Random Fragmentation and Coagulation Processes. Cambridge Studies in Advanced Mathematics 102. Cambridge Univ. Press, Cambridge.
[11] Bertoin, J. and Rouault, A. (2005). Discretization methods for homogeneous fragmentations. J. London Math. Soc. (2) 72 91–109.
[12] Donnelly, P. and Joyce, P. (1991). Consistent ordered sampling distributions: Characterization and convergence. Adv. in Appl. Probab. 23 229–258.
[13] Duquesne, T. and Le Gall, J.-F. (2008). Re-rooting for Lévy trees and snakes. In preparation.
[14] Duquesne, T. and Le Gall, J.-F. (2002). Random trees, Lévy processes and spatial branching processes. Astérisque 281 1–147.
[15] Duquesne, T. and Le Gall, J.-F. (2005). Probabilistic and fractal aspects of Lévy trees. Probab. Theory Related Fields 131 553–603.
[16] Evans, S. N., Pitman, J. and Winter, A. (2006). Rayleigh processes, real trees, and root growth with re-grafting. Probab. Theory Related Fields 134 81–126.
[17] Evans, S. N. and Winter, A. (2006). Subtree prune and regraft: A reversible real tree-valued Markov process. Ann. Probab. 34 918–961.
[18] Ford, D. J. (2008). Probabilities on cladograms: Introduction to the alpha model. Preprint. Available at arXiv:math.PR/0511246.
[19] Gnedin, A. and Pitman, J. (2005). Regenerative composition structures. Ann. Probab. 33 445–479.
[20] Gnedin, A., Pitman, J. and Yor, M. (2006). Asymptotic laws for compositions derived from transformed subordinators. Ann. Probab. 34 468–492.
[21] Gnedin, A. V. (1997). The representation of composition structures. Ann. Probab. 25 1437–1450.
[22] Greenwood, P. and Pitman, J. (1980). Construction of local time and Poisson point processes from nested arrays. J. London Math. Soc. (2) 22 182–192.
Mathematical Reviews (MathSciNet):
MR579823
[23] Haas, B. (2003). Loss of mass in deterministic and random fragmentations. Stochastic Process. Appl. 106 245–277.
[24] Haas, B. (2007). Fragmentation processes with an initial mass converging to infinity. J. Theoret. Probab. 20 721–758.
[25] Haas, B. and Miermont, G. (2004). The genealogy of self-similar fragmentations with negative index as a continuum random tree. Electron. J. Probab. 9 57–97 (electronic).
[26] Haas, B., Miermont, G., Pitman, J. and Winkel, M. (2008). Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models. Ann. Probab. 36 1790–1837.
[27] Kingman, J. F. C. (1978). The representation of partition structures. J. London Math. Soc. (2) 18 374–380.
Mathematical Reviews (MathSciNet):
MR509954
[28] Le Gall, J.-F. and Weill, M. (2006). Conditioned Brownian trees. Ann. Inst. H. Poincaré Probab. Statist. 42 455–489.
[29] Miermont, G. (2003). Self-similar fragmentations derived from the stable tree. I. Splitting at heights. Probab. Theory Related Fields 127 423–454.
[30] Miermont, G. (2005). Self-similar fragmentations derived from the stable tree. II. Splitting at nodes. Probab. Theory Related Fields 131 341–375.
[31] Pitman, J. (1999). Coalescents with multiple collisions. Ann. Probab. 27 1870–1902.
[32] Pitman, J. (2006). Combinatorial Stochastic Processes. Lecture Notes in Math. 1875. Springer, Berlin.
[33] Pitman, J. and Yor, M. (1992). Arcsine laws and interval partitions derived from a stable subordinator. Proc. London Math. Soc. (3) 65 326–356.
[34] Pitman, J. and Yor, M. (1997). The two-parameter Poisson–Dirichlet distribution derived from a stable subordinator. Ann. Probab. 25 855–900.
[35] Schroeder, E. (1870). Vier combinatorische Probleme. Z. f. Math. Phys. 15 361–376.
[36] Stanley, R. P. (1999). Enumerative Combinatorics. Vol. 2. Cambridge Studies in Advanced Mathematics 62. Cambridge Univ. Press, Cambridge.