Stein's method for the single server queue in heavy traffic
From MaRDI portal
Publication:2288737
DOI10.1016/j.spl.2019.108566zbMath1450.60054arXiv1805.08003OpenAlexW2964354753WikidataQ127364731 ScholiaQ127364731MaRDI QIDQ2288737
Publication date: 20 January 2020
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.08003
Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20) Limit theorems in probability theory (60F99)
Related Items (5)
The Prelimit Generator Comparison Approach of Stein’s Method ⋮ Diffusive limits of Lipschitz functionals of Poisson measures ⋮ Stein's method for diffusive limits of queueing processes ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Convergence Rate of Random Geometric Sum Distributions to the Laplace Law
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Diffusion models and steady-state approximations for exponentially ergodic Markovian queues
- Stein's method for comparison of univariate distributions
- Stein's method for steady-state diffusion approximations of \(\mathrm{M}/\mathrm{Ph}/n+\mathrm{M}\) systems
- Stein's method for dependent random variables occuring in statistical mechanics
- Error bounds for exponential approximations of geometric convolutions
- Total variation error bounds for geometric approximation
- New rates for exponential approximation and the theorems of Rényi and Yaglom
- Compound geometric approximation under a failure rate constraint
- Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models
- Investigation of waiting time problems by reduction to Markov processes
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
- Sharp bounds for exponential approximations under a hazard rate upper bound
- Applied Probability and Queues
- On Choosing and Bounding Probability Metrics
- Beyond Heavy-Traffic Regimes: Universal Bounds and Controls for the Single-Server Queue
- Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach
This page was built for publication: Stein's method for the single server queue in heavy traffic