Related papers: A large-deviations analysis of the GI/GI/1 SRPT qu…
In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…
One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have…
The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for…
In this paper we propagate a large deviations approach for proving limit theory for (generally) multivariate time series with heavy tails. We make this notion precise by introducing regularly varying time series. We provide general large…
We investigate the statistics of the local time $\mathcal{T} = \int_0^T \delta(x(t)) dt$ that a run and tumble particle (RTP) $x(t)$ in one dimension spends at the origin, with or without an external drift. By relating the local time to the…
The distributions of "time of flight" (time spent by a single fluid particle between two crossings of the Poincar\'e section) are investigated for five different 3D stationary chaotic mixers. Above all, we study the large tails of those…
We consider GI/Ph/n+M parallel-server systems with a renewal arrival process, a phase-type service time distribution, n homogenous servers, and an exponential patience time distribution with positive rate. We show that in the Halfin-Whitt…
In this paper, we study the $G/\mathit{GI}/N$ queue in the Halfin--Whitt regime. Our first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a…
We obtain sample-path large deviations for a class of one-dimensional stochastic differential equations with bounded drifts and heavy-tailed L\'evy processes. These heavy-tailed L\'evy processes do not satisfy the exponential integrability…
A large deviations principle is established for the joint law of the empirical measure and the flow measure of a renewal Markov process on a finite graph. We do not assume any bound on the arrival times, allowing heavy tailed distributions.…
We analyze the finite sample regret of a decreasing step size stochastic gradient algorithm. We assume correlated noise and use a perturbed Lyapunov function as a systematic approach for the analysis. Finally we analyze the escape time of…
We propose a novel approach for quantifying deviations from Gaussianity by leveraging the permutation Jensen-Shannon distance. Using stable distributions as a flexible framework, we analyze the effects of skewness and heavy tails in…
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of its performances. We concentrate on the logarithmic tail…
We say that a random variable is $light$-$tailed$ if moments of order $2+\epsilon$ are finite for some $\epsilon>0$; otherwise, we say that it is $heavy$-$tailed$. We study queueing networks that operate under the Max-Weight scheduling…
In this paper we consider the first passage percolation with identical and independent exponentially distributions, called the Eden growth model, and we study the upper tail large deviations for the first passage time ${\rm T}$. Our main…
We consider a fixed-point equation for a non-negative integer-valued random variable, that appears in branching processes with state-independent immigration. A similar equation appears in the analysis of a single-server queue with a…
We discuss large deviation properties of continuous-time random walks (CTRW) and present a general expression for the large deviation rate in CTRW in terms of the corresponding rates for the distributions of steps' lengths and waiting…
We consider sojourn or response times in processor-shared queues that have a finite population of potential users. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in…