On family trees and subtrees of simple branching processes

DOI10.1007/BF01258742zbMath0731.60076OpenAlexW2081184537MaRDI QIDQ808106

Anthony G. Pakes, F. Michel Dekking

Publication date: 1991

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01258742

zbMATH Keywords

branching processnumerical calculationsbinary subtree

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Random fractals and their intersection with winning sets, Fractal percolation, porosity, and dimension, Dynamical Gibbs-non-Gibbs transitions in Widom-Rowlinson models on trees, Number of complete \(N\)-ary subtrees on Galton-Watson family trees, Mixing time of a kinetically constrained spin model on trees: power law scaling at criticality, Strong noise sensitivity and random graphs, Survival probabilities for \(N\)-ary subtrees on a Galton-Watson family tree

Cites Work

• Unnamed Item
• On the structure of Mandelbrot's percolation process and other random Cantor sets
• Connectivity properties of Mandelbrot's percolation process
• Phase transition in reinforced random walk and RWRE on trees
• Branching Processes That Grow Faster Than Binary Splitting