Tid: 18 februari 2002 kl 1515-1600
Plats : Seminarierummet 3733, Institutionen för matematik, KTH, Lindstedts väg 25, plan 7. Karta!
Föredragshållare: Sead Omérov.
Titel: Comparison of methods for computing total variation distance bounds for compound Poisson approximations of word counts. (Examensarbete)
Sammanfattning:
Three significantly different methods are available for computing the upper bound for compound Poisson approximations of word counts. Here we first shortly describe these three methods, then analyse how the bounds differ in five pre-defined transition matrices and finally perform simulation runs where various parameters are concurrently randomised. The results obtained, and the conclusions drawn, take into consideration that the three methods are not always simultaneously applicable.
The source code and the simulation runs are written in a way to make modifications and alternate simulation runs as simple as possible.