University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Galton-Watson trees and Apollonian networks

Galton-Watson trees and Apollonian networks

Add to your list(s) Download to your calendar using vCal

  • UserHenning Sulzbach (Birmingham)
  • ClockThursday 26 January 2017, 15:00-16:00
  • HouseLTC Watson.

If you have a question about this talk, please contact Dr Andrew Treglown.

In the analysis of critical Galton-Watson trees conditional on their sizes, two complementary approaches have proved fruitful over the last decades. First, the so-called size-biased tree allows the study of local properties such as node degrees. Second, the global scaling limit, the Continuum Random tree, provides access to the study of average or extreme node depths. In this talk, I will discuss the approximation of the tree by subtrees with bounded node degrees. Here, the so-called “heavy subtrees” play an important role. An application will be given in terms of uniform Apollonian networks.

The talk is based on joint work with Luc Devroye (McGill, Montreal) and Cecilia Holmgren (Uppsala).

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.