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...

תיאור מלא

מידע ביבליוגרפי

מחבר ראשי:	Svante Janson
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Discrete Mathematics & Theoretical Computer Science 2012-01-01
סדרה:	Discrete Mathematics & Theoretical Computer Science
נושאים:	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]
גישה מקוונת:	https://dmtcs.episciences.org/3013/pdf
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!