Conditioned Galton-Watson trees do not grow - DMTCS
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

Conditioned Galton-Watson trees do not grow

Svante Janson
  • Function : Author
  • PersonId : 830454
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.

Domains

Data Structures and Algorithms [cs.DS] Discrete Mathematics [cs.DM] Combinatorics [math.CO]
Fichier principal
Vignette du fichier
dmAG0124.pdf (142.25 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Coordination Episciences Iam  : Connect in order to contact the contributor

https://inria.hal.science/hal-01184685

Submitted on : Monday, August 17, 2015-2:23:06 PM

Last modification on : Monday, April 8, 2024-10:23:59 AM

Long-term archiving on : Wednesday, November 18, 2015-10:44:41 AM

Download

Dates and versions

hal-01184685 , version 1 (17-08-2015)

Identifiers

Cite

Svante Janson. Conditioned Galton-Watson trees do not grow. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.331-334, ⟨10.46298/dmtcs.3483⟩. ⟨hal-01184685⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS
67 View
710 Download

Altmetric

Share

More