University of Cambridge > > Isaac Newton Institute Seminar Series > Rare event simulation for stochastics networks

Rare event simulation for stochastics networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

We shall discuss several importance sampling techniques for efficient estimation of overfow probabilities or sampling conditional paths in stochastic networks. We are interested in a wide class of environments including light-tailed and heavy-tailed networks. Our discussion includes algorithms that are optimal in the sense of achieving the best possible rate of convergence as the associated large deviations parameter increases. For instance, in the case of arbitrary Jackson networks our estimators are strongly efficient and we can generate exact conditional overflow paths in linear time (as a function of the overflow level). This talk is based on joint work with Peter Glynn, Henry Lam, Kevin Leder, Chenxin Li and Jingchen Liu.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity