Free Access
Issue
ESAIM: PS
Volume 20, 2016
Page(s) 400 - 416
DOI https://doi.org/10.1051/ps/2016019
Published online 30 November 2016
  1. E.A. Cator and H. Don, Constructing and searching conditioned Galton−Watson trees. Preprint arXiv:1412.5890 (2014). [Google Scholar]
  2. J. Geiger and G. Kersting, The Galton−Watson tree conditioned on its height. In Probability Theory Mathematical Statistics: Proceedings of the 7th Vilnius Conference 1998. TEV, Vilnius (1999) 277–286. [Google Scholar]
  3. J. Geiger, Elementary new proofs of classical limit theorems for Galton−Watson processes. J. Appl. Probab. 36 (1999) 301–309. [CrossRef] [MathSciNet] [Google Scholar]
  4. S. Janson, Simply generated trees, conditioned Galton−Watson trees, random allocations and condensation. Probab. Surveys 9 (2012) 103–252. [CrossRef] [MathSciNet] [Google Scholar]
  5. R. Lyons and Y. Peres, Probability on Trees and Networks. Cambridge University Press. Available at http://pages.iu.edu/˜rdlyons/ (2016). To appear in Cambridge Series in Stat. Probab. Math. (2017). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.