Skip to main content

Scaling limits of multi-type Markov Branching trees

Abstract

We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and their type and give rise to (size,type)-children in a Galton–Watson fashion, with the rule that the size of any individual is at least the sum of the sizes of its children. Assuming that the macroscopic size-splittings are rare, we describe the scaling limits of multi-type Markov Branching trees in terms of multi-type self-similar fragmentation trees. We observe three different regimes according to whether the probability of type change of a size-biased child is proportional to the probability of macroscopic splitting (the critical regime, in which we get in the limit multi-type fragmentation trees with indeed several types), smaller than the probability of macroscopic splitting (the solo regime, in which the limit trees are monotype as we never see a type change), or larger than the probability of macroscopic splitting (the mixing regime, in which case the types mix in the limit and we get monotype fragmentation trees). This framework allows us to unify models which may a priori seem quite different, a strength which we illustrate with two notable applications. The first one concerns the description of the scaling limits of growing models of random trees built by gluing at each step on the current structure a finite tree picked randomly in a finite alphabet of trees, extending Rémy’s well-known algorithm for the generation of uniform binary trees to a fairly broad framework. We are then either in the critical regime with multi-type fragmentation trees in the scaling limit, or in the solo regime. The second application concerns the scaling limits of large multi-type critical Galton–Watson trees when the offspring distributions all have finite second moments. This topic has already been studied but our approach gives a different proof and we improve on previous results by relaxing some hypotheses. We are then in the mixing regime: the scaling limits are always multiple of the Brownian CRT, a pure monotype fragmentation tree in our framework.

This is a preview of subscription content, access via your institution.

References

  1. Abraham, R., Delmas, J.-F., Hoscheit, P.: A note on the Gromov–Hausdorff–Prokhorov distance between (locally) compact metric measure spaces. Electron. J. Probab. 18(14), 1–21 (2013)

    MathSciNet  MATH  Google Scholar 

  2. Addario-Berry, L., Broutin, N., Goldschmidt, C., Miermont, G.: The scaling limit of the minimum spanning tree of the complete graph. Ann. Probab. 45(5), 3075–3144 (2017)

    MathSciNet  MATH  Google Scholar 

  3. Aldous, D.: The continuum random tree III. Ann. Probab. 21(1), 248–289 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Aldous, D.: Probability distributions on cladograms. In: Aldous, D., Pemantle, R. (eds.) Random Discrete Structures (Minneapolis, MN, 1993). The IMA Volumes in Mathematics and Its Applications, vol. 76, pp. 1–18. Springer, New York (1996)

    Google Scholar 

  5. Asmussen, S.: Applied Probability and Queues. Applications of Mathematics: Stochastic Modelling and Applied Probability. Springer, Berlin (2003)

    MATH  Google Scholar 

  6. Bertoin, J.: Self-similar fragmentations. Ann. Inst. Henri Poincaré Probab. Stat. 38(3), 319–340 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bertoin, J.: Random Fragmentation and Coagulation Processes. Cambridge Studies in Advanced Mathematics, vol. 102. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  8. Bertoin, J.: Homogeneous multitype fragmentations. In: Sidoravicius, V., Vares, M.E. (eds.) In and Out of Equilibrium 2. Progress in Probability, vol. 60, pp. 161–183. Birkhäuser, Basel (2008)

    Google Scholar 

  9. Bertoin, J.: Fires on trees. Ann. Inst. Henri Poincaré Probab. Stat. 48(4), 909–921 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Berzunza, G.: On scaling limits of multitype Galton–Watson trees with possibly infinite variance. ALEA Lat. Am. J. Probab. Math. Stat. 15(1), 21–48 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  11. Billingsley, P.: Convergence of Probability Measures. Wiley, New York (1968)

    MATH  Google Scholar 

  12. Broutin, N., Devroye, L., McLeish, E., de la Salle, M.: The height of increasing trees. Random Struct. Algorithms 32(4), 494–518 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Curien, N., Haas, B.: The stable trees are nested. Probab. Theory Relat. Fields 157(1), 847–883 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dadoun, B.: Self-similar growth fragmentations as scaling limits of Markov Branching Processes. J. Theor. Probab. 33(2), 590–610 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  15. de Raphélis, L.: Scaling limit of multitype Galton–Watson trees with infinitely many types. Ann. Inst. Henri Poincaré Probab. Stat. 53(1), 200–225 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dubins, L.E., Freedman, D.A.: A sharper form of the Borel–Cantelli lemma and the strong law. Ann. Math. Statist. 36, 800–807 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  17. Duchamps, J.-J.: Fragmentations with self-similar branching speeds. Preprint, arXiv:1907.04712

  18. Duquesne, T.: A limit theorem for the contour process of conditioned Galton–Watson trees. Ann. Probab. 31(2), 996–1027 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Evans, S., Winter, A.: Subtree prune and regraft: a reversible tree-valued Markov process. Ann. Probab. 34(3), 81–126 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ford, D.: Probabilities on cladograms: introduction to the alpha model. Preprint, arXiv:math/0511246

  21. Haas, B.: Scaling limits of Markov-Branching trees and applications. In: XII Symposium of Probability and Stochastic Processes, pp. 3–50. Springer (2018)

  22. Haas, B., Miermont, G.: The genealogy of self-similar fragmentations with negative index as a continuum random tree. Electron. J. Probab. 9(4), 57–97 (2004)

    MathSciNet  MATH  Google Scholar 

  23. Haas, B., Miermont, G.: Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees. Ann. Probab. 40(6), 2589–2666 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  24. Haas, B., Miermont, G., Pitman, J., Winkel, M.: Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models. Ann. Probab. 36(5), 1790–1837 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  25. Haas, B., Stephenson, R.: Scaling limits of \(k\)-ary growing trees. Ann. Inst. Henri Poincaré Probab. Stat. 51(4), 1314–1341 (2015)

    MathSciNet  MATH  Google Scholar 

  26. Haas, B., Stephenson, R.: Bivariate Markov chains converging to Lamperti transform Markov additive processes. Stoch. Process. Appl. 128(10), 3558–3605 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  27. Miermont, G.: Invariance principles for spatial multitype Galton–Watson trees. Ann. Inst. Henri Poincaré Probab. Statist. 44(6), 1128–1161 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Miermont, G.: Tessellations of random maps of arbitrary genus. Ann. Sci. Éc. Norm. Supér. 42(5), 725–781 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  29. Pagnard, C.: Local limits of Markov branching trees and their volume growth. Electron. J. Probab. 22(95), 1–53 (2017)

    MathSciNet  MATH  Google Scholar 

  30. Pemantle, R.: A time-dependent version of Pólya’s urn. J. Theor. Probab. 3(4), 627–637 (1990)

    Article  MATH  Google Scholar 

  31. Rémy, J.-L.: Un procédé itératif de dénombrement d’arbres binaires et son application à leur génération aléatoire. RAIRO Inform. Théor. 19(2), 179–195 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  32. Rizzolo, D.: Scaling limits of Markov branching trees and Galton–Watson trees conditioned on the number of vertices with out-degree in a given set. Ann. Inst. Henri Poincaré Probab. Stat. 51(2), 512–532 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  33. Sénizergues, D.: Growing random graphs with a preferential attachment structure. Preprint, arXiv:2002.09999

  34. Sénizergues, D.: Random gluing of metric spaces. Ann. Probab. 47(6), 3812–3865 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  35. Stephenson, R.: General fragmentation trees. Electron. J. Probab. 18(101), 1–45 (2013)

    MathSciNet  MATH  Google Scholar 

  36. Stephenson, R.: Local convergence of large critical multi-type Galton–Watson trees and applications to random maps. J. Theor. Probab. 31(1), 159–205 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  37. Stephenson, R.: On the exponential functional of Markov additive processes, and applications to multi-type self-similar fragmentation processes and trees. ALEA Lat. Am. J. Probab. Math. Stat. 15(2), 1257–1292 (2018)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bénédicte Haas.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work is partially supported by the ANR GRAAL ANR-14-CE25-0014 and the EPSRC Fellowship EP/N004833/1. Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Haas, B., Stephenson, R. Scaling limits of multi-type Markov Branching trees. Probab. Theory Relat. Fields 180, 727–797 (2021). https://doi.org/10.1007/s00440-021-01064-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00440-021-01064-2

Mathematics Subject Classification

  • 60F17
  • 60J80