First order probabilities for Galton-Watson trees
From MaRDI portal
Publication:4604396
Abstract: In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such finite subtrees will be almost surely present when the tree is infinite. Introducing the notion of universal trees, we show that all first order sentences of quantifier depth depend only on local neighbourhoods of the root of sufficiently large radius depending on . We compute the probabilities of these neighbourhoods conditioned on the tree being infinite. We give an almost sure theory for infinite trees.
Recommendations
- Galton-Watson probability contraction
- Stochastic ordering of infinite binomial Galton-Watson trees
- Analyticity for rapidly determined properties of Poisson Galton-Watson trees
- Local limits of large Galton-Watson trees rerooted at a random vertex
- Stochastic ordering of infinite geometric Galton-Watson trees
Cites work
Cited in
(7)- Combinatorial games on Galton-Watson trees involving several-generation-jump moves
- Analyticity for rapidly determined properties of Poisson Galton-Watson trees
- Probability of first return on Cayley trees
- Continuous phase transitions on Galton–Watson trees
- Galton-Watson probability contraction
- Stochastic ordering of infinite geometric Galton-Watson trees
- Stochastic ordering of infinite binomial Galton-Watson trees
This page was built for publication: First order probabilities for Galton-Watson trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604396)