skip to content

Quantum random walks

Presented by: 
R Pemantle [Pennsylvania]
Thursday 29th June 2006 - 11:30 to 12:30
INI Seminar Room 1

A problem posed by Aldous is to estimate the complexity of finding a (1 - epsilon)-optimal particle in a branching random walk. This is computed in terms of the probability of existence of a trajectory staying forever above the critical drift minus epsilon. (it is known that no particle can stay above the critical drift forever). I will then discuss the computation of this probability, in a continous time (branching Brownian motion) setting, which involves estimating solutions to the KPP equation.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons