First order probabilities for Galton-Watson trees

From MaRDI portal
Publication:4604396

DOI10.1007/978-3-319-44479-6_29zbMATH Open1381.60082arXiv1510.08832OpenAlexW1851722155MaRDI QIDQ4604396FDOQ4604396


Authors: Moumanti Podder, Joel Spencer Edit this on Wikidata


Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

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 k depend only on local neighbourhoods of the root of sufficiently large radius depending on k. We compute the probabilities of these neighbourhoods conditioned on the tree being infinite. We give an almost sure theory for infinite trees.


Full work available at URL: https://arxiv.org/abs/1510.08832




Recommendations




Cites Work


Cited In (4)





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)