Upcoming events

Ralph Neininger: CLT-Analogs in Random Combinatorial Structures  

Abstract: In this talk a couple of parameters of random combinatorial structures related to discrete algorithms are discussed which exhibit almost sure convergence after normalization towards a random limit. The subject of the talk are the fluctuations within such a convergence. Three instances are discussed, firstly a univariate case related to search trees, secondly a periodic case related to urn models where there is only an almost sure approximation by a random periodic object and thirdly a functional case related to a selection algorithm where the fluctuations can be described by a Gaussian process.