Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Conditioned Galton-W ...
Conference paper

Conditioned Galton-Watson trees do not grow

Svante Janson (1)
(1) Department of Mathematics [Uppsala]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3483
License
https://about.hal.science/hal-authorisation-v1
Indicators
572
Views
676
Downloads

Conditioned Galton-Watson trees do not grow

Svante Janson (1)
(1) Department of Mathematics [Uppsala]
Abstract
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.
Keywords
  • [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]
  • conditioned Galton-Watson trees
  • random trees
  • profile
Cited by

Source: OpenCitations

  • Stochastic Ordering of Infinite Geometric Galton–Watson Trees

    Journal of Theoretical Probability

    Authors : Erik I. Broman ORCID

    Journal reference : Volume 29, 2015, pp. 1069-1082

    DOI : 10.1007/s10959-015-0608-x

  • Generalized gamma approximation with rates for urns, walks and trees

    The Annals of Probability

    Authors : Erol A. Peköz, Adrian Röllin, Nathan Ross

    Journal reference : Volume 44, 2016, pp.

    DOI : 10.1214/15-aop1010

  • A Note on the Probability of Cutting a Galton-Watson Tree

    Electronic Journal of Probability

    Authors : Luc Devroye ORCID

    Journal reference : Volume 16, 2011, pp.

    DOI : 10.1214/ejp.v16-952

  • Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees

    The Annals of Probability

    Authors : Louigi Addario-Berry, Luc Devroye, Svante Janson

    Journal reference : Volume 41, 2013, pp.

    DOI : 10.1214/12-aop758

  • Trickle-down processes and their boundaries

    Electronic Journal of Probability

    Authors : Steven Evans ORCID, Rudolf Grübel ORCID, Anton Wakolbinger

    Journal reference : Volume 17, 2012, pp.

    DOI : 10.1214/ejp.v17-1698

  • Comparing Graphs of Different Sizes

    arXiv (Cornell University)

    Authors : RUSSELL LYONS ORCID

    Journal reference : Volume 26, 2017, pp. 681-696

    DOI : 10.1017/s096354831700013x

  • Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees

    Random Structures and Algorithms

    Authors : Luc Devroye ORCID, Svante Janson ORCID

    Journal reference : Volume 38, 2010, pp. 381-395

    DOI : 10.1002/rsa.20319

  • Arbres pour l’Algorithmique

    Authors : Brigitte Chauvin, Julien Clément ORCID, Danièle Gardy ORCID

    Journal reference : Volume , 2018, pp.

    DOI : 10.1007/978-3-319-93725-0
Preview
Loading PDF preview...