Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

arXiv:2606.18218 · math.PR, cs.LG, eess.SY, math.OC, stat.ML · Submitted 2026-06-16 · Read on arXiv

Hao Liang, Cheng Tang, Yunzong Xu

math.PR, cs.LG, eess.SY, math.OC, stat.ML

Submitted: 2026-06-16

Code: https://github.com/learning-decision/finite-time-queue-peaklaws

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Anisotropy — 3× in this paper · explained in 3 episodes
• Ambient Dimension — 1× in this paper · explained in 1 episode
• Benchmark — 1× in this paper · explained in 2 episodes
• Homogeneity — 1× in this paper · explained in 2 episodes
• Lyapunov function — 1× in this paper · explained in 2 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes
• Robustness — 1× in this paper · explained in 5 episodes

Sources

• Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control

Related papers

• Sharp Deviations Bounds for Dirichlet Weighted Sums with Application to analysis of Bayesian algorithms
• Local Anticoncentration for Gaussian Boson Sampling via Conditional Wishart Geometry
• Beyond the Semicircle: Free Diffusion Models with Prescribed Equilibria
• A New Bound on the Cumulant Generating Function of Dirichlet Processes
• The Site Frequency Spectrum in an Exponentially Growing Population with Selection
• Statistical inference for a multiscale stochastic model of enzyme kinetics via propagation of chaos