Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract

We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other cases (i.e., when no equivalent critical Galton-Wa...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	Svante Janson
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2012-01-01
Subjects:	simply generated tree branching process [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] [info.info-cg] computer science [cs]/computational geometry [cs.cg]
Online Access:	https://dmtcs.episciences.org/3013/pdf