Related papers: On convergence rate for an infinite-channel queuin…
We consider the almost semi-continuous processes defined on a finite Markov chain. The representation of the moment generating functions for the absolute maximum after achievement positive level and for the recovery time are obtained.…
We introduce a rate balance principle for general (not necessarily Markovian) stochastic processes. Special attention is given to processes with birth and death like transitions, for which it is shown that for any state $i$, the rate of two…
We establish sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the existence and exponential ergodicity of the Q-process, the process…
We consider a point process $i+\xi_i$, where $i\in \bZ$ and the $\xi_{i}$'s are i.i.d. random variables with variance $\sigma^{2}$. This process, with a suitable rescaling of the distribution of $\xi_i$'s, converges to the Poisson process…
We consider a stochastic particle system in which a finite number of particles interact with one another via a common energy tank. Interaction rate for each particle is proportional to the square root of its kinetic energy, as is consistent…
We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive…
This paper provides a mathematical framework for estimation of the service time distribution and the expected service time of an infinite-server queueing system with a nonhomogeneous Poisson arrival process, in the case of partial…
Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…
In this paper, we introduce a versatile scheme for optimizing the arrival rates of quasi-reversible queueing systems. We first propose an alternative definition of quasi-reversibility that encompasses reversibility and highlights the…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed…
We consider a class of interacting particle systems in continuous space of non-gradient type, which are reversible with respect to Poisson point processes with constant density. For these models, a rate of convergence was recently obtained…
This paper studies the rate of convergence of the power-of-two-choices, a celebrated randomized load balancing algorithm for many-server queueing systems, to its mean field limit. The convergence to the mean-field limit has been proved in…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
Purification is a process in which decoherence is partially reversed by using several input systems which have been subject to the same noise. The purity of the outputs generally increases with the number of input systems, and decreases…
We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…
We present methods for evaluating the rate of change in quantities during quantum evolution due to coupling to the environment (dissipation hereafter). The protocol is based on repeating a given quantum circuit (or quantum operation) twice,…
We study the time it takes for all states of a finite quantum system to return simultaneously to their original configuration. In particular, we define the recurrence time for a quantum system to be the time at which all time-evolved states…
Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as "batch" (or, in some cases, "bulk") arrival queueing systems. In this work we study the affect of…
Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…