Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-08T01:04:38.927Z Has data issue: false hasContentIssue false

Convergence of the height process of supercritical Galton–Watson forests with an application to the configuration model in the critical window

Published online by Cambridge University Press:  02 April 2024

Serte Donderwinkel*
Affiliation:
McGill University
*
*Postal address: Burnside Hall, 805 Sherbrooke Street West, Montréal, Quebec H3A 0B9, Canada. Email address: serte.donderwinkel@mcgill.ca
Rights & Permissions [Opens in a new window]

Abstract

We show joint convergence of the Łukasiewicz path and height process for slightly supercritical Galton–Watson forests. This shows that the height processes for supercritical continuous-state branching processes as constructed by Lambert (2002) are the limit under rescaling of their discrete counterparts. Unlike for (sub-)critical Galton–Watson forests, the height process does not encode the entire metric structure of a supercritical Galton–Watson forest. We demonstrate that this result is nonetheless useful, by applying it to the configuration model with an independent and identically distributed power-law degree sequence in the critical window, of which we obtain the metric space scaling limit in the product Gromov–Hausdorff–Prokhorov topology, which is of independent interest.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. The information captured in $S^n$ and $S^n-\underline{\underline{S}}^{n}$ under $\mathbb{P}_n^\uparrow$.

Figure 1

Figure 2. The information captured in $S^n$ and $S^n-\underline{\underline{S}}^{n}$ under $\mathbb{P}_n$. The finite trees are encoded by the pre-infimum process, and the infinite spine and its pendant subtrees are encoded by the post-infimum process.