Random tree recursions: Which fixed points correspond to tangible sets of trees?

DOI10.1002/RSA.20895zbMath1445.05028arXiv1808.03019OpenAlexW3106318087WikidataQ126797466 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

zbMATH Keywords

fixed pointGalton-Watson treeinterpretationtree automatonendogenyrecursive distributional equation

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Boolean functions (06E30) Infinite graphs (05C63)

Related Items (3)

Continuous phase transitions on Galton–Watson trees ⋮ Galton–Watson games ⋮ Recursive tree processes and the mean-field limit of stochastic flows

This page was built for publication: Random tree recursions: Which fixed points correspond to tangible sets of trees?