skip to content

Simple random walk on supercritical causal maps

Presented by: 
Thomas Budzinski ENS - Paris, Université Paris-Sud 11
Monday 16th July 2018 - 14:35 to 14:55
INI Seminar Room 1
We study the simple random walk on supercritical causal maps, obtained from a supercritical Galton-Watson tree by adding at each level a cycle joining neighbour vertices. In particular, we will prove that, if
the underlying tree has no leaf, the simple random walk has almost sure positive speed.

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons