The Galton-Watson process conditioned on the total progeny
From MaRDI portal
Publication:4085040
DOI10.2307/3212730zbMath0322.60072MaRDI QIDQ4085040
Publication date: 1975
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212730
60F05: Central limit and other weak theorems
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
Fixed points of 321-avoiding permutations, On the number of vertices with a given degree in a Galton-Watson tree, Random stable-type minimal factorizations of the n-cycle, Graph limits of random graphs from a subset of connected k‐trees, Unnamed Item, Root estimation in Galton–Watson trees, Trees with exponential height dependent weight, Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Spectral dimension of trees with a unique infinite spine, Large deviations for i.i.d. replications of the total progeny of a Galton-Watson process, Moment of degeneration of a branching process and height of a random tree, Finite size percolation in regular trees, Percolation on random triangulations and stable looptrees, On exact simulation algorithms for some distributions related to Jacobi theta functions, Branching processes. I, Branching processes, random trees, and a generalized scheme of arrangements of particles, A note on weak convergence results for infinite causal triangulations, Heavy subtrees of Galton-Watson trees with an application to Apollonian networks, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, Cost functionals for large (uniform and simply generated) random trees, Trees with power-like height dependent weight, Limits of random tree-like discrete structures, The Horton-Strahler number of conditioned Galton-Watson trees, An analysis of budgeted parallel search on conditional Galton-Watson trees, Limit theorems for conditioned non-generic Galton-Watson trees, Random walk on random infinite looptrees, On weighted heights of random trees, Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees, Finding paths in sparse random graphs requires many queries, Scaling limits for a family of unrooted trees, The distribution of height and diameter in random non-plane binary trees
