pith. sign in

arxiv: 2604.08887 · v1 · submitted 2026-04-10 · 🧮 math.PR · math.OC

Heavy-traffic limit of stationary distributions of a state-dependent queue

Pith reviewed 2026-05-10 17:57 UTC · model grok-4.3

classification 🧮 math.PR math.OC
keywords heavy trafficstate-dependent queuestationary distributiondiffusion limitnegative driftmulti-level queue
0
0 comments X

The pith

The heavy-traffic limit of stationary distributions for state-dependent queues takes a closed form precisely when the limiting drift is negative.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

In a single-server queue with arbitrary state-dependent arrival and service speeds, the paper studies the diffusion-scaled stationary queue-length distribution under heavy traffic. The distributions are tight whenever the limiting drift is negative for large queue lengths. Assuming that vague limit points have densities, the limit distribution is given in closed form if and only if this negative-drift condition holds. The density assumption is satisfied automatically for multi-level queues, solving the problem completely in that case.

Core claim

We show that the heavy-traffic limit of the stationary distributions is obtained in a closed form if and only if that negative drift condition holds, under the density condition that the limit of every vaguely convergent subsequence has a density. The sequence of distributions is also shown to be tight when the heavy-traffic limit of their drifts exists and is negative.

What carries the argument

The limiting drift function (arrival speed minus service speed) as queue length tends to infinity, which controls whether the stationary distribution converges to a non-degenerate closed-form limit.

If this is right

  • The sequence of stationary distributions of the diffusion-scaled process is tight under the existence of a negative limiting drift.
  • Under the density condition, the limiting distribution exists in closed form exactly when the drift condition holds.
  • For multi-level queues the density condition always holds, so the closed-form limit follows directly from negative drift.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Designers of load-dependent service policies can use the closed form to predict performance near capacity.
  • The result may extend to finding optimal state-dependent rates that minimize cost while satisfying the negative-drift requirement.
  • Similar drift conditions could be used to analyze heavy-traffic limits in other state-dependent stochastic systems.

Load-bearing premise

The limit of every vaguely convergent subsequence of the stationary distributions has a density.

What would settle it

A specific state-dependent speed function where the limiting drift is negative but the actual stationary distribution after scaling does not match the closed-form expression or lacks a density.

read the original abstract

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper, we consider this heavy-traffic limit for the single server queue which has the most general possible state-dependence. Namely, arrival and service speeds may take any values depending on the queue length. Here, the terminology, heavy-traffic limit, stands for a diffusion-scaled limit in heavy-traffic for processes, distributions and modeling primitives. This general model is referred to as a state-dependent queue. There are two motivations for this generalization. One is interest in the state-dependent queue itself because it allows finer control of service speed in application. Another is making it clear how the heavy-traffic limit is obtained under what conditions for the state-dependent queue. Thus, we start to study basic properties of this state-dependent queue, including its stability. We then take the sequence of the stationary distributions of its diffusion scaled queue-length processes. We have three main results for this sequence. We first show that it is tight if the heavy-traffic limit of their drifts exists and is negative as the queue length goes to infinity, where a drift is the arrival speed minus the service speed. We next assume the condition that the limit of every vaguely convergent subsequence has a density, which is referred to as a density condition, and show that the heavy-traffic limit of the stationary distributions is obtained in a closed form if and only if that negative drift condition holds. We then show that the density condition is always satisfied for the multi-level queue, so the problem is nicely solved for the multi-level queue.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 4 minor

Summary. The manuscript studies the heavy-traffic limit of the stationary distributions for a general state-dependent single-server queue, where arrival and service rates depend arbitrarily on the queue length. It establishes three main results: (1) tightness of the sequence of diffusion-scaled stationary distributions under the condition that the limiting drift is negative, (2) under an auxiliary density condition on vague subsequential limits, the limit exists in closed form if and only if the negative drift condition holds, and (3) the density condition is satisfied for the multi-level queue subclass.

Significance. This work extends heavy-traffic diffusion approximations to highly general state-dependent queues, providing explicit conditions for the existence and form of the limiting stationary distribution. The closed-form expression and the resolution for multi-level queues are particularly valuable for applications in energy-efficient systems. The use of standard tightness and weak convergence arguments, combined with the verification of the density condition in a subclass, strengthens the contribution. If the proofs are complete and correct, this could serve as a foundational reference for state-dependent queueing models.

minor comments (4)
  1. The abstract cites 'Atar and Miyazawa [1] (2026)'; confirm the publication year and full reference details, as 2026 appears prospective.
  2. Clarify the precise meaning of 'vaguely convergent subsequence' and the topology used when stating the density condition (likely in the section introducing the main theorems).
  3. Ensure consistent notation for the drift process (arrival speed minus service speed) between the abstract, the stability section, and the limit theorems.
  4. The multi-level queue verification of the density condition is stated as always holding; add a brief remark on whether this extends immediately to other natural subclasses or requires separate arguments.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our work on heavy-traffic limits for general state-dependent queues, as well as the recommendation for minor revision. The significance noted for the closed-form results and the multi-level queue subclass is appreciated. No specific major comments were raised in the report, so we provide no point-by-point rebuttals below.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation relies on standard tightness arguments for the diffusion-scaled stationary distributions under a negative limiting drift condition, followed by identification of the limit under an auxiliary density condition on vague subsequential limits. The density condition is stated as an assumption for the general state-dependent case and is separately verified for the multi-level subclass; neither step reduces the claimed closed-form limit to a fitted quantity, self-definition, or load-bearing self-citation chain. The iff statement is scoped to the assumed conditions and follows from weak-convergence machinery applied to the model primitives without internal reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard weak-convergence tools and one domain-specific density assumption; no free parameters or new entities are introduced.

axioms (2)
  • standard math Tightness criteria for diffusion-scaled processes under state-dependent rates
    Invoked to obtain tightness of the sequence of stationary distributions when the limiting drift is negative.
  • domain assumption Every vaguely convergent subsequence possesses a density
    Required to pass from tightness to an explicit closed-form limit; verified only for the multi-level case.

pith-pipeline@v0.9.0 · 5628 in / 1171 out tokens · 46807 ms · 2026-05-10T17:57:13.897582+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter collaboration edition editor eid eprint howpublished institution journal key month note number numpages organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.con...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    and Miyazawa, M

    Atar, R. and Miyazawa, M. (2026). Heavy traffic limit with discontinuous coefficients via a non-standard semimartingale decomposition. To appear in Mathematics of Operations Research. ://arxiv.org/pdf/2502.16467v2

  4. [4]

    , Dai, J

    Braverman, A. , Dai, J. and Miyazawa, M. (2017). Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach. Stochastic Systems, 7 143--196

  5. [5]

    , Dai, J

    Braverman, A. , Dai, J. and Miyazawa, M. (2024). The BAR -approach for multiclass queueing networks with SBP service policies. Stochastic Systems. Published online in Articles in Advance, ://doi.org/10.1287/stsy.2023.0011

  6. [6]

    Chung, K. L. (2001). A Course in Probability Theory. 3rd ed. Academic Press (An Imprint of Elsevier)

  7. [7]

    Dai, J. G. (1995). On positive H arris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability, 5 49--77

  8. [8]

    Davis, M. H. A. (1993). Markov Models and Optimization. Monographs on Statistics and Applied Probability 49, Chapman & Hall

  9. [9]

    and Shiryaev, A

    Jacod, J. and Shiryaev, A. N. (2003). Limit Theorems for stochastic processes. 2nd ed. Springer, Berlin

  10. [10]

    Kallenberg, O. (2001). Foundations of Modern Probability. 2nd ed. Springer Series in Statistics, Probability and its applications, Springer, New York

  11. [11]

    , Miyazawa, M

    Kobayashi, M. , Miyazawa, M. and Sakuma, Y. (2025). Heavy traffic limit of stationary distribution of multi-level single server queue under time change. Research report. ://arxiv.org/abs/2505.03504

  12. [12]

    Miyazawa, M. (1994). Rate conservation laws: a survey. Queueing Systems, 15 1--58

  13. [13]

    Miyazawa, M. (2017). A unified approach for large queue asymptotics in a heterogeneous multiserver queue. Advances in Applied Probability, 49 182--220. ://dx.doi.org/10.1017/apr.2016.84

  14. [14]

    (2024 a )

    Miyazawa, M. (2024 a ). Multi-level reflecting Brownian motion on the half line and its stationary distribution. Journal of the Indian Society for Probability and Statistics, 25 543--574. ://arxiv.org/abs/2405.16764

  15. [15]

    (2024 b )

    Miyazawa, M. (2024 b ). Palm problems arising in bar approach and its applications. Queueing Systems , 108 253--273. ://arxiv.org/abs/2308.03553

  16. [16]

    Miyazawa, M. (2025). Diffusion approximation of the stationary distribution of a two-level single server queue. Advances in Applied Probability, 57 1167--1205. ://arxiv.org/abs/2312.11284