Related papers: Steady-state $\mathit{GI}/\mathit{GI}/\mathit{n}$ …
The paper deals with the fast-slow motions setups in the discrete time $X^\epsilon((n+1)\epsilon)=X^\epsilon(n\epsilon)+\epsilon B(X^\epsilon(n\epsilon),\xi(n))$, $n=0,1,...,[T/\epsilon]$ and the continuous time $\frac…
In the seminal paper of Gamarnik and Zeevi (2006), the authors justify the steady-state diffusion approximation of a generalized Jackson network (GJN) in heavy traffic. Their approach involves the so-called limit interchange argument, which…
We consider an irreducible pure jump Markov process with rates Q=(q(x,y)) on \Lambda\cup\{0\} with \Lambda countable and 0 an absorbing state. A quasi-stationary distribution (qsd) is a probability measure \nu on \Lambda that satisfies:…
We obtain functional central limit theorems for both discrete time expressions of the form $1/\sqrt{N}\sum_{n=1}^{[Nt]}(F(X(q_1(n)),\ldots, X(q_{\ell}(n)))-\bar{F})$ and similar expressions in the continuous time where the sum is replaced…
We consider N single server infinite buffer queues with service rate beta. Customers arrive at rate N times alpha,choose L queues uniformly, and join the shortest one. The stability condition is alpha strictly less than beta. We study in…
In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209--213) showed how to build…
Constant-stepsize stochastic approximation (SA) is widely used in learning for computational efficiency. For a fixed stepsize, the iterates typically admit a stationary distribution that is rarely tractable. Prior work shows that as the…
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…
A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…
This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…
We obtain asymptotic bounds for the tail distribution of steady-state waiting time in a two server queue where each server processes incoming jobs at a rate equal to the rate of their arrivals (that is, the half-loaded regime). The job…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
The main contribution of this paper is to present a new sufficient condition for the subexponential asymptotics of the stationary distribution of a GI/GI/1-type Markov chain without jumps from level "infinity" to level zero. For simplicity,…
We consider a large-scale flexible service system with two large server pools and two types of customers. Servers in pool 1 can only serve type 1 customers, while server in pool 2 are flexible -- they can serve both types 1 and 2. (This is…
We study point processes on the real line whose configurations $X$ are locally finite, have a maximum and evolve through increments which are functions of correlated Gaussian variables. The correlations are intrinsic to the points and…
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with nondegenerate slowdown. This regime is distinct from the well-studied heavy…
A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework, which was first introduced to derive the stability region for stochastic…
We study a single server queue operating under the shortest remaining processing time (SRPT) scheduling policy; that is, the server preemptively serves the job with the shortest remaining processing time first. In this work we are…
In this paper, we extend a result of Kesten and Spitzer (1979). Let us consider a stationary sequence $(\xi\_k:=f(T^k(.)))\_k$ given by an invertible probability dynamical system and some centered function $f$. Let $(S\_n)\_n$ be a simple…
Consider N particles moving independently, each one according to a subcritical continuous-time Galton-Watson process unless it hits 0, at which time it jumps instantaneously to the position of one of the other particles chosen uniformly at…