Related papers: A rate balance principle and its application to qu…
Through the analysis of a dataset of ultra high frequency order book updates, we introduce a model which accommodates the empirical properties of the full order book together with the stylized facts of lower frequency financial data. To do…
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\lambda n$, with $0<\lambda<1$, and are immediately dispatched to one of…
We consider a polling system with two queues, where a single server is attending the queues in a cyclic order and requires non-zero switching times to switch between the queues. Our aim is to identify a fairly general and comprehensive…
For a stochastic process $(X_t)_{t\geq 0}$ we establish conditions under which the inverse first-passage time problem has a solution for any random variable $\xi >0$. For Markov processes we give additional conditions under which the…
In this paper we review some results on time-homogeneous birth-death processes. Specifically, for truncated birth-death processes with two absorbing or two reflecting endpoints, we recall the necessary and sufficient conditions on the…
We establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state…
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…
The main purpose of this paper is to extend the information-based asset-pricing framework of Brody-Hughston-Macrina to a more general set-up. We include a wider class of models for market information and in contrast to the original paper,…
The symmetric birth and death process in the integers $\{1, \ldots, N \}$ with linear rates is studied. The process moves slowly and spends more time in the neighborhood of the state 1. It represents our attempt at explaining the asymmetry…
In this paper, we study optimal control problems for multiclass GI/M/n+M queues in an alternating renewal (up-down) random environment in the Halfin-Whitt regime. Assuming that the downtimes are asymptotically negligible and only the…
Strong driving of quantum systems opens opportunities for both controlling and characterizing their states. For theoretical studying of these systems properties we use the rate-equation formalism. The advantage of such approach is its…
We consider the down/up crossing property of weighted Markov branching processes. The joint probability distribution of multi crossing numbers of such processes are obtained. In particular, for Markov branching processes, the probability…
A fluid queue is a stochastic process which moves linearly with a rate that is determined by the state of a continuous-time Markov chain (CTMC). In this paper we construct an approximation to a fluid queue using a quasi birth-and-death…
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and…
These lecture notes introduce the statistical analysis of continuous-time generative models built from Markov dynamics. We begin with the stochastic-calculus foundations of score-based diffusion models, including time reversal, score…
Gaussian Process state-space models capture complex temporal dependencies in a principled manner by placing a Gaussian Process prior on the transition function. These models have a natural interpretation as discretized stochastic…
We study continuous-time Markov chains on the non-negative integers under mild regularity conditions (in particular, the set of jump vectors is finite and both forward and backward jumps are possible). Based on the so-called flux balance…
Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…
Causal reversibility blends reversibility and causality for concurrent systems. It indicates that an action can be undone provided that all of its consequences have been undone already, thus making it possible to bring the system back to a…
We introduce a multiclass single-server queueing system in which the arrival rates depend on the current job in service. The system is characterized by a matrix of arrival rates in lieu of a vector of arrival rates. Our proposed model…