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 where is a mean zero random walk, and with 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 queue where the service time distribution has infinite mean.
Recommendations
Cites work
- scientific article; zbMATH DE number 1188967 (Why is no real title available?)
- Applied Probability and Queues
- Big queues.
- Exact Sampling of Stationary and Time-Reversed Queues
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Perfect sampling for infinite server and loss systems
- Perfect sampling of GI/GI/\(c\) queues
- Simulating the maximum of a random walk
- Steady-state simulation of reflected Brownian motion and related stochastic networks
Cited in
(2)
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)