Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.12197 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908773382094848 |
|---|---|
| author | Chatterjee, Bihan Maguluri, Siva Theja Mukherjee, Debankur |
| author_facet | Chatterjee, Bihan Maguluri, Siva Theja Mukherjee, Debankur |
| contents | We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the limit. Our focus is on obtaining pre-asymptotic, higher-order approximations that go beyond the classical exponential limit. Using Stein's method, we develop an approach based on higher-order expansions of the generator of the underlying Markov process. The key technical step is to represent higher-order derivatives in terms of lower-order ones and control the resulting error via derivative bounds of the Stein equation. Under suitable moment-matching conditions on the service distribution, we show that the approximation error decays as a high-order power of the slack parameter $\varepsilon=1-ρ$. Error bounds are established in the Zolotarev metric, which further imply bounds on the Wasserstein distance as well as the moments. Our results demonstrate that the accuracy of the exponential approximation can be systematically improved by matching progressively more moments of the service distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_12197 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method Chatterjee, Bihan Maguluri, Siva Theja Mukherjee, Debankur Probability We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the limit. Our focus is on obtaining pre-asymptotic, higher-order approximations that go beyond the classical exponential limit. Using Stein's method, we develop an approach based on higher-order expansions of the generator of the underlying Markov process. The key technical step is to represent higher-order derivatives in terms of lower-order ones and control the resulting error via derivative bounds of the Stein equation. Under suitable moment-matching conditions on the service distribution, we show that the approximation error decays as a high-order power of the slack parameter $\varepsilon=1-ρ$. Error bounds are established in the Zolotarev metric, which further imply bounds on the Wasserstein distance as well as the moments. Our results demonstrate that the accuracy of the exponential approximation can be systematically improved by matching progressively more moments of the service distribution. |
| title | Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method |
| topic | Probability |
| url | https://arxiv.org/abs/2601.12197 |