Tid: 14 februari 2000 kl 1515-1700

Plats : Seminarierummet 3733, Institutionen för matematik, KTH, Lindstedts väg 25, plan 7. Karta!

Föredragshållare: Svante Janson, Matematik, Uppsala Univeristet. Publikationslista.

Titel: Parking problem, hashing, random forests, graph enumeration, random walks and Brownian motion.


Several very different problems in discrete mathematics have turned out to have solutions related to each other. The common theme is that the problems can be analyzed using certain random walks. This also links these discrete problems to Brownian motion. I will describe some of these problems and their connections.

Till seminarielistan
To the list of seminars