Related papers: On convergence rate for an infinite-channel queuin…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
The initial-boundary value problem for an infinite one-dimensional chain of harmonic oscillators on the half-line is considered. The large time asymptotic behavior of solutions is studied. The initial data of the system are supposed to be a…
In this paper we are discussing the question how a continuous quantum system can be simulated by mean field fluctuations of a finite number of qubits. On the kinematical side this leads to a convergence result which states that…
A convergent iterative procedure is proposed for the calculation of the relative entropy of entanglement of a given bipartite quantum state. When this state turns out to be non-separable the algorithm provides the corresponding optimal…
This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO…
We investigate entanglement dynamics in multipartite systems, establishing a quantitative concept of entanglement flow: both flow through individual particles, and flow along general networks of interacting particles. In the former case,…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential…
This is the continuation of cond-mat/0505084. Elementary formulas are derived for the flow of entropy through a circuit junction in a near-critical quantum circuit, based on the structure of the energy-momentum tensor at the junction. The…
We show that for an open quantum system which is classically chaotic (a quartic double well with harmonic driving coupled to a sea of harmonic oscillators) the rate of entropy production has, as a function of time, two relevant regimes: For…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by shot noise. A shot-noise rate emerges as a natural model, if the arrival rate tends…
We present formulas to compute the busy cycle renewal function for the $M|G|\infty$ queue and exemplify for some service time distributions. The busy cycle renewal function value in t is the number of busy periods that begin in the interval…
Convergence of stochastic processes with jumps to diffusion processes is investigated in the case when the limit process has discontinuous coefficients. An example is given in which the diffusion approximation of a queueing model yields a…
We suggest an approach to obtaining general two-sided bounds on the rate of convergence in terms of special "weighted" norms related to total variation. Some important classes of continuous-time Markov chains are considered:…
We study a single-server priority queue with a finite number of classes, in which the arrivals follow a fractional Poisson process of index $\alpha \in (0,1]$ and the service completions are triggered by an independent fractional Poisson…
The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
Queueing networks are systems of theoretical interest that find widespread use in the performance evaluation of interconnected resources. In comparison to counterpart models in genetics or mathematical biology, the stochastic (jump)…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…