English
Related papers

Related papers: A Note on Stein's Method for Heavy-Traffic Analysi…

200 papers

Following recent developments in the application of Stein's method in queueing theory, this paper is intended to be a short treatment showing how Stein's method can be developed and applied to the single server queue in heavy traffic. Here…

Probability · Mathematics 2019-08-28 Robert E. Gaunt , Neil Walton

The drift method was recently developed to study queueing systems in steady-state. It was successfully used to obtain bounds on the moments of the scaled queue lengths, that are asymptotically tight in heavy-traffic, in a wide variety of…

Probability · Mathematics 2022-01-12 Daniela Hurtado-Lange , Siva Theja Maguluri

In this note, we apply Stein's method to analyze the performance of general load balancing schemes in the many-server heavy-traffic regime. In particular, consider a load balancing system of $N$ servers and the distance of arrival rate to…

Probability · Mathematics 2020-04-28 Xingyu Zhou , Ness Shroff

Stein's method is a powerful technique for proving central limit theorems in probability theory when more straightforward approaches cannot be implemented easily. This article begins with a survey of the historical development of Stein's…

Probability · Mathematics 2014-04-08 Sourav Chatterjee

The present paper proposes a stochastic model of the traffic flow. This model has a discrete set of states and the continuous time. The model is a generalization of the discrete stochastis model that has been considered in a previous paper…

Other Condensed Matter · Physics 2007-05-23 A. P. Buslaev , A. G. Tatashev , M. V. Yashina

We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…

Probability · Mathematics 2015-12-01 Gianmarco Bet , Remco van der Hofstad , Johan S. H. van Leeuwaarden

We develop a general approach to Stein's method for approximating a random process in the path space $D([0,T]\to R^d)$ by a real continuous Gaussian process. We then use the approach in the context of processes that have a representation as…

Probability · Mathematics 2024-01-24 A. D. Barbour , Nathan Ross , Guangqu Zheng

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,…

Probability · Mathematics 2026-04-13 Masahiro Kobayashi , Masakiyo Miyazawa , Yutaka Sakuma

We present an adaptation of Stein's method of normal approximation to the study of both discrete- and continuous-time dynamical systems. We obtain new correlation-decay conditions on dynamical systems for a multivariate central limit…

Probability · Mathematics 2017-01-12 Olli Hella , Juho Leppänen , Mikko Stenlund

Stein's method compares probability distributions through the study of a class of linear operators called Stein operators. While mainly studied in probability and used to underpin theoretical statistics, Stein's method has led to…

We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the CRP condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of…

Probability · Mathematics 2021-03-03 D. Hurtado-Lange , S. T. Maguluri

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…

Probability · Mathematics 2025-03-18 Anton Braverman , Ziv Scully

Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let $W$ denote the steady-state waiting time in the ${\rm GI}/{\rm G}/1$ queue. Kingman (1961) showed that $W$, when…

Probability · Mathematics 2022-06-22 M. A. A. Boon , A. J. E. M. Janssen , J. S. H. van Leeuwaarden

While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…

Statistical Mechanics · Physics 2009-11-10 Dirk Helbing

Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertation is concerned with establishing theoretical guarantees on…

Probability · Mathematics 2017-04-28 Anton Braverman

Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this…

Adaptation and Self-Organizing Systems · Physics 2015-06-04 J. -Q. Dong , Z. -G. Huang , Z. Zhou , L. Huang , Z. -X. Wu , Y. Do , Y. -H. Wang

We consider the problem of minimizing the delay of jobs moving through a directed graph of service nodes. In this problem, each node may have several links and is constrained to serve one link at a time. As jobs move through the network,…

Networking and Internet Architecture · Computer Science 2019-03-08 Hsu-Chieh Hu , Stephen F. Smith

This paper provides a general framework for Stein's density method for multivariate continuous distributions. The approach associates to any probability density function a canonical operator and Stein class, as well as an infinite…

Probability · Mathematics 2023-04-27 Guillaume Mijoule , Martin Raič , Gesine Reinert , Yvik Swan

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,…

Probability · Mathematics 2026-01-21 Bihan Chatterjee , Siva Theja Maguluri , Debankur Mukherjee

We introduce a version of Stein's method for proving concentration and moment inequalities in problems with dependence. Simple illustrative examples from combinatorics, physics, and mathematical statistics are provided.

Probability · Mathematics 2007-05-23 Sourav Chatterjee
‹ Prev 1 2 3 10 Next ›