Conditioned Galton-Watson trees do not grow

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.
Type de document :
Communication dans un congrès
Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.331-334, 2006, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184685
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 14:23:06
Dernière modification le : jeudi 11 mai 2017 - 01:03:04
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 10:44:41

Fichier

dmAG0124.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184685, version 1

Collections

Citation

Svante Janson. Conditioned Galton-Watson trees do not grow. Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.331-334, 2006, DMTCS Proceedings. 〈hal-01184685〉

Partager

Métriques

Consultations de la notice

42

Téléchargements de fichiers

73