Related papers: A one-dimensional diffusion model for overloaded q…
This paper provides an introduction to the Stein method framework in the context of steady-state diffusion approximations. The framework consists of three components: the Poisson equation and gradient bounds, generator coupling, and moment…
We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing…
The article describes the diffusion approximation and the method of its use for evaluation of the effectiveness of active queue management (AQM) mechanisms. The presented model combines the approximation and simulation approaches. The…
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…
This paper studies a service system in which arriving customers are provided with information about the delay they will experience. Based on this information they decide to wait for service or to leave the system. Specifically, every…
In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm so-called Walk on Moving Spheres was already introduced in the Brownian context. The aim is…
We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between two measures $\nu$ and $\mu$ supported on $\mathbb{R}^d$ such that $\mu$ is the reversible measure of a diffusion process. In order to…
We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival…
A major bottleneck of standard auto-regressive large language models is that their inference process is inherently sequential, resulting in very long and costly inference times. To circumvent this, practitioners proposed a class of language…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the…
We study the statistical properties of first-passage Brownian functionals (FPBFs) of an Ornstein-Uhlenbeck (OU) process in the presence of stochastic resetting. We consider a one dimensional set-up where the diffusing particle sets off from…
We study the empirical process arising from a multi-dimensional diffusion process with periodic drift and diffusivity. The smoothing properties of the generator of the diffusion are exploited to prove the Donsker property for certain…
We give an explicit representation for the transition law of a tempered stable Ornstein-Uhlenbeck process and use it to develop a rejection sampling algorithm for exact simulation of increments from this process. Our results apply to…
The so-called "supOU" processes, namely the superpositions of Ornstein-Uhlenbeck type processes are stationary processes for which one can specify separately the marginal distribution and the dependence structure. They can have finite or…
We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice…
We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have…
Assuming that a reflected Ornstein-Uhlenbeck state process is observed at discrete time instants, we propose generalized moment estimators to estimate all drift and diffusion parameters via the celebrated ergodic theorem. With the sampling…
For a stopped diffusion process in a multidimensional time-dependent domain $\D$, we propose and analyse a new procedure consisting in simulating the process with an Euler scheme with step size $\Delta$ and stopping it at discrete times…