Tata Institute of Fundamental Research
Overdispersion and Multi-timescale Models: Exact Asymptotics
STCS Colloquium
Speaker:
Michel Mandjes (University of Amsterdam
Korteweg-de Vries Institute for
Mathematics
Science Park 904
1098 XH Amsterdam
The Netherlands)
Organiser:
Sandeep K Juneja
Date:
Tuesday, 23 Jan 2018, 14:30 to 15:30
Venue:
A-201 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
Poisson processes are frequently used, e.g. to model the customer arrival process in service systems, or the claim arrival proces in insurance models. In various situations, however, the fluctuations in the arrival rate are so severe that the Poisson assumption ceases to hold. In a commonly followed approach to remedy this, the deterministic parameter λ is replaced by a stochastic process Λ(t); in this way the arrival process becomes “overdispersed”. The first part of this talk considers the case that the Poisson rate is sampled periodically, with a focus on an infinite-server queue fed by the resulting overdispersed arrival process. After having presented a functional central limit theorem, we concentrate on tail probabilities under a particular scaling of the arrival process and the sampling frequency. We derive logarithmic tail asymptotics, and in specific cases even exact tail asymptotics.
In the second part of the talk we embed our overdispersion setting in a more general framework. The probability of interest is expressed in terms of the composition of two Lévy processes, which can alternatively be seen as a Lévy process with random time change. For this two-timescale model we present exact tail asymptotics. The proof relies on an adaptation of classical techniques developed by Bahadur and Rao, in combination with delicate Edgeworth expansion arguments. The resulting asymptotics have a remarkable form, with finitely many sublinear terms in the exponent (joint work with Mariska Heemskerk and Julia Kuhn).
| Speaker: | Michel Mandjes (University of Amsterdam Korteweg-de Vries Institute for Mathematics Science Park 904 1098 XH Amsterdam The Netherlands) |
| Organiser: | Sandeep K Juneja |
| Date: | Tuesday, 23 Jan 2018, 14:30 to 15:30 |
| Venue: | A-201 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
Poisson processes are frequently used, e.g. to model the customer arrival process in service systems, or the claim arrival proces in insurance models. In various situations, however, the fluctuations in the arrival rate are so severe that the Poisson assumption ceases to hold. In a commonly followed approach to remedy this, the deterministic parameter λ is replaced by a stochastic process Λ(t); in this way the arrival process becomes “overdispersed”. The first part of this talk considers the case that the Poisson rate is sampled periodically, with a focus on an infinite-server queue fed by the resulting overdispersed arrival process. After having presented a functional central limit theorem, we concentrate on tail probabilities under a particular scaling of the arrival process and the sampling frequency. We derive logarithmic tail asymptotics, and in specific cases even exact tail asymptotics.
In the second part of the talk we embed our overdispersion setting in a more general framework. The probability of interest is expressed in terms of the composition of two Lévy processes, which can alternatively be seen as a Lévy process with random time change. For this two-timescale model we present exact tail asymptotics. The proof relies on an adaptation of classical techniques developed by Bahadur and Rao, in combination with delicate Edgeworth expansion arguments. The resulting asymptotics have a remarkable form, with finitely many sublinear terms in the exponent (joint work with Mariska Heemskerk and Julia Kuhn).
In the second part of the talk we embed our overdispersion setting in a more general framework. The probability of interest is expressed in terms of the composition of two Lévy processes, which can alternatively be seen as a Lévy process with random time change. For this two-timescale model we present exact tail asymptotics. The proof relies on an adaptation of classical techniques developed by Bahadur and Rao, in combination with delicate Edgeworth expansion arguments. The resulting asymptotics have a remarkable form, with finitely many sublinear terms in the exponent (joint work with Mariska Heemskerk and Julia Kuhn).