






















This paper has been withdrawn by Anton Braverman
No PDF available, click to view other formats
Abstract:Diffusion approximations are widely used in the analysis of service systems, providing tractable insights into complex models. While heavy-traffic limit theorems justify these approximations asymptotically, they do not quantify the error when the system is not in the limit regime. This paper presents a tutorial on the generator comparison approach of Stein's method for analyzing diffusion approximations in Markovian models where state transitions are governed by general clocks, which extends the well-established theory for continuous-time Markov chains and enables non-asymptotic error bounds for these approximations. Building on recent work that applies this method to single-clock systems, we develop a framework for handling models with multiple general clocks. Our approach is illustrated through canonical queueing systems, including the G/G/1 queue, the join-the-shortest-queue system, and the tandem queue. We highlight the role of the Palm inversion formula and the compensated queue-length process in extracting the diffusion generator. Most of our error terms depend only on the first three moments of the general clock distribution. The rest require deeper, model-specific, insight to bound, but could in theory also depend on only the first three moments.
From: Anton Braverman [view email]
[v1]
Sat, 15 Mar 2025 16:16:33 UTC (48 KB)
[v2]
Tue, 30 Jun 2026 16:52:01 UTC (1 KB) (withdrawn)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。