Random tree recursions: Which fixed points correspond to tangible sets of trees?
From MaRDI portal
Publication:5113956
DOI10.1002/rsa.20895zbMath1445.05028arXiv1808.03019WikidataQ126797466 ScholiaQ126797466MaRDI QIDQ5113956
Tobias Johnson, Moumanti Podder, Fiona Skerman
Publication date: 19 June 2020
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03019
fixed point; Galton-Watson tree; interpretation; tree automaton; endogeny; recursive distributional equation
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
06E30: Boolean functions
05C63: Infinite graphs
Related Items
Continuous phase transitions on Galton–Watson trees, Galton–Watson games, Recursive tree processes and the mean-field limit of stochastic flows