Galton-Watson probability contraction
From MaRDI portal
Publication:516101
DOI10.1214/17-ECP47zbMATH Open1360.60157arXiv1512.07371MaRDI QIDQ516101FDOQ516101
Authors: Moumanti Podder, Joel Spencer
Publication date: 21 March 2017
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Abstract: We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with offspring distribution. Fixing a positive integer , we exploit the -move Ehrenfeucht game on rooted trees for this purpose. Let , indexed by , denote the finite set of equivalence classes arising out of this game, and the set of all probability distributions over . Let denote the true probability of the class under regime, and the true probability vector over all the equivalence classes. Then we are able to define a natural recursion function , and a map such that is a fixed point of , and starting with any distribution , we converge to this fixed point via because it is a contraction. We show this both for and , though the techniques for these two ranges are quite different.
Full work available at URL: https://arxiv.org/abs/1512.07371
Recommendations
- First order probabilities for Galton-Watson trees
- Random tree recursions: Which fixed points correspond to tangible sets of trees?
- On the number of vertices with a given degree in a Galton-Watson tree
- Estimates of the extinction probability of the Galton-Watson process
- Galton-Watson trees with vanishing martingale limit
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cited In (4)
This page was built for publication: Galton-Watson probability contraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516101)