First Order Probabilities for Galton–Watson Trees

  • Moumanti PodderEmail author
  • Joel Spencer


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.


  1. 1.
    N. Alon, J.H. Spencer, The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 3rd edn. (Wiley, Hoboken, 2008). ISBN:978-0-470-17020-5, doi:  10.1002/9780470277331, With an appendix on the life and work of Paul Erdős
  2. 2.
    J. Spencer, The Strange Logic of Random Graphs. Volume 22 of Algorithms and Combinatorics (Springer, Berlin, 2001). ISBN:3-540-41654-4, doi:  10.1007/978-3-662-04538-1,
  3. 3.
    J. Spencer, L. Thoma, On the limit values of probabilities for the first order properties of graphs, in Contemporary Trends in Discrete Mathematics (Štiřín Castle, 1997). Volume 49 of DIMACS Series in Discrete Mathematics & Theoretical Computer Science (American Mathematical Society, Providence, 1999), pp. 317–336Google Scholar
  4. 4.
    R. van der Hofstad, Random Graphs and Complex Networks, vol. 1. Lecture Notes (2015).

Copyright information

© Springer International publishing AG 2017

Authors and Affiliations

  1. 1.Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA
  2. 2.Computer Science and Mathematics Departments, Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA

Personalised recommendations