Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, April 06, 2023, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Maxime Larcher

A Galton-Watson tree is a random tree where each node has a random number of children, drawn i.i.d. according to some given probability distribution X. Sampling from uniformly from usual families of trees can sometimes be reduced to sampling a Galton-Watson tree (conditioned on the size) with an appropriate X. For instance, if X is uniform over {0,2} then the distribution of the Galton-Watson tree of size n is uniform over binary trees.

In 2012, Devroye showed it was possible to draw a Galton-Watson tree conditioned on having size exactly n in linear time, provided that E[X]=1 and the second moment of X is bounded. We extend his result and show that this is possible as long the a-th moment of X is bounded, for some a ∈ (1,2]. We also explore the case E[X] ≠ 1.

This is work in progress, joint with Johannes Lengler, Frank Mousset, Andreas Noever and Konstantinos Panagiotou.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login