Invariance principles for Galton-Watson trees conditioned on the number of leaves (Q444351): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The author investigates the asymptotics of critical Galton-Watson trees with offspring distribution which is aperiodic and belongs to the domain of attraction of an \(\alpha\)-stable law, \(\alpha\in (1,2]\). The first main result provides the asymptotics for the probability of having \(n\) leaves, as \(n\to\infty\). The second main result treats Galton-Watson trees conditioned on having a large fixed number of leaves. For such trees, an invariance principle is proved which states that the Lukasiewicz path, the height function and the contour function, all properly rescaled, converge weakly to a triple \((X^{\text{exc}}, H^{\text{exc}}, H^{\text{exc}})\), where \(X^{\text{exc}}\) is the normalized excursion of a strictly \(\alpha\)-stable spectrally positive Lévy process, and \(H^{\text{exc}}\) is its associated continuous-time height function. In the case \(\alpha\in (1,2)\), the last result along with the continuous mapping argument immediately leads to a limit theorem for the law of the maximal degree in the conditioned Galton-Watson tree. In the remaining case \(\alpha=2\), which requires a separate treatment, it is shown that the maximal degree, properly rescaled, converges to one in probability. Finally, extensions of the two main results are given to the situation when the event ``the number of leaves equals \(n\)'' is replaced by ``the number of vertices with degrees belonging to the given subset of \(N\) equals \(n\)''. | |||
Property / review text: The author investigates the asymptotics of critical Galton-Watson trees with offspring distribution which is aperiodic and belongs to the domain of attraction of an \(\alpha\)-stable law, \(\alpha\in (1,2]\). The first main result provides the asymptotics for the probability of having \(n\) leaves, as \(n\to\infty\). The second main result treats Galton-Watson trees conditioned on having a large fixed number of leaves. For such trees, an invariance principle is proved which states that the Lukasiewicz path, the height function and the contour function, all properly rescaled, converge weakly to a triple \((X^{\text{exc}}, H^{\text{exc}}, H^{\text{exc}})\), where \(X^{\text{exc}}\) is the normalized excursion of a strictly \(\alpha\)-stable spectrally positive Lévy process, and \(H^{\text{exc}}\) is its associated continuous-time height function. In the case \(\alpha\in (1,2)\), the last result along with the continuous mapping argument immediately leads to a limit theorem for the law of the maximal degree in the conditioned Galton-Watson tree. In the remaining case \(\alpha=2\), which requires a separate treatment, it is shown that the maximal degree, properly rescaled, converges to one in probability. Finally, extensions of the two main results are given to the situation when the event ``the number of leaves equals \(n\)'' is replaced by ``the number of vertices with degrees belonging to the given subset of \(N\) equals \(n\)''. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Aleksander M. Iksanov / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60J80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60F17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6065645 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random trees | |||
Property / zbMATH Keywords: random trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
invariance principles | |||
Property / zbMATH Keywords: invariance principles / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scaling limits | |||
Property / zbMATH Keywords: scaling limits / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
conditioned Galton-Watson trees | |||
Property / zbMATH Keywords: conditioned Galton-Watson trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
stable trees | |||
Property / zbMATH Keywords: stable trees / rank | |||
Normal rank |
Revision as of 02:48, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Invariance principles for Galton-Watson trees conditioned on the number of leaves |
scientific article |
Statements
Invariance principles for Galton-Watson trees conditioned on the number of leaves (English)
0 references
14 August 2012
0 references
The author investigates the asymptotics of critical Galton-Watson trees with offspring distribution which is aperiodic and belongs to the domain of attraction of an \(\alpha\)-stable law, \(\alpha\in (1,2]\). The first main result provides the asymptotics for the probability of having \(n\) leaves, as \(n\to\infty\). The second main result treats Galton-Watson trees conditioned on having a large fixed number of leaves. For such trees, an invariance principle is proved which states that the Lukasiewicz path, the height function and the contour function, all properly rescaled, converge weakly to a triple \((X^{\text{exc}}, H^{\text{exc}}, H^{\text{exc}})\), where \(X^{\text{exc}}\) is the normalized excursion of a strictly \(\alpha\)-stable spectrally positive Lévy process, and \(H^{\text{exc}}\) is its associated continuous-time height function. In the case \(\alpha\in (1,2)\), the last result along with the continuous mapping argument immediately leads to a limit theorem for the law of the maximal degree in the conditioned Galton-Watson tree. In the remaining case \(\alpha=2\), which requires a separate treatment, it is shown that the maximal degree, properly rescaled, converges to one in probability. Finally, extensions of the two main results are given to the situation when the event ``the number of leaves equals \(n\)'' is replaced by ``the number of vertices with degrees belonging to the given subset of \(N\) equals \(n\)''.
0 references
random trees
0 references
invariance principles
0 references
scaling limits
0 references
conditioned Galton-Watson trees
0 references
stable trees
0 references