Svante Janson - Conditioned Galton-Watson trees do not grow

dmtcs:3483 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities - https://doi.org/10.46298/dmtcs.3483
Conditioned Galton-Watson trees do not grow

Authors: Svante Janson 1

  • 1 Department of Mathematics [Uppsala]

An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.

https://doi.org/10.46298/dmtcs.3483
Source: HAL:hal-01184685v1
Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: conditioned Galton-Watson trees,random trees,profile,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1007/978-3-662-12788-9_7
  • 10.1007/978-3-662-12788-9_7
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms

5 Documents citing this article

Share and export

Consultation statistics

This page has been seen 142 times.
This article's PDF has been downloaded 135 times.