University of Cambridge > Talks.cam > Probability > On the monotonicity of the speed of biased random walk on a Galton-Watson tree without leaves

On the monotonicity of the speed of biased random walk on a Galton-Watson tree without leaves

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

If you have a question about this talk, please contact neb25.

We will present different results related to the speed of biased random walks in random environments. Our main focus will be on a recent paper (by Ben Arous, Fribergh and Sidoravicius) proving that the speed of the biased random walk on a Galton-Watson tree without leaves is increasing for high biases. This partially addresses a question asked by Lyons, Pemantle and Peres.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity