Analytic combinatorics approaches to study discrete stochastic processes
Vortrag von Prof. Dr. Alois Panholzer
Sprecher eingeladen von: Prof. Dr. Jean Bertoin
Datum: 27.11.13 Zeit: 17.15 - 18.15 Raum: ETH
A basic combinatorial approach to analyze the behaviour of discrete stochastic processes relies on the exact enumeration of combinatorial objects with certain properties. In many cases such random structures allow an exact recursive description, which is the basis of a further analytic approach often involving complex analytic techniques. Although the results obtained by such an approach sometimes lack in generality, when applicable, one often gets a very precise description. We will illustrate this method by some concrete examples including the so-called hiring problem, some parking problems as well as the analysis of simple evolutionary algorithms.