Exact sampling of the infinite horizon maximum of a random walk over a nonlinear boundary

From MaRDI portal
Publication:4968514




Abstract: We present the first algorithm that samples maxngeq0Snnalpha, where Sn is a mean zero random walk, and nalpha with alphain(1/2,1) defines a nonliner boundary. We show that our algorithm has finite expected running time. We also apply the algorithm to construct the first exact simulation method for the steady-state departure process of a GI/GI/infty queue where the service time distribution has infinite mean.









This page was built for publication: Exact sampling of the infinite horizon maximum of a random walk over a nonlinear boundary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968514)