Related papers: Approximation of Excessive Backlog Probabilities o…

We study the first passage time $\tau_u = \inf \{ n \geq 1: |V_n| > u \}$ for the multivariate perpetuity sequence $V_n = Q_1 + M_1 Q_2 + \cdots + (M_1 \ldots M_{n-1}) Q_n$, where $(M_n, Q_n)$ is a sequence of independent and identically…

The waiting time distribution $w(\tau)$, i.e. the probability for a delay $\tau$ between two subsequent transition (`jumps') of particles, is a statistical tool in (quantum) transport. Using generalized Master equations for systems coupled…

Let $S_n$ be a random walk with i.i.d. increments which have zero mean and finite variance. For every $x\ge0$ we define the stopping time $\tau_x:=\inf\{n\ge1:x+S_n\le0\}$ and consider the probabilities $\mathbb{P}(x+S_n\ge y,\tau_x>n)$. We…

Let $X = (X_1, X_2)$ be a 2-dimensional random variable and $X(n), n \in \mathbb{N}$ a sequence of i.i.d. copies of $X$. The associated random walk is $S(n)= X(1) + \cdots +X(n)$. The corresponding absorbed-reflected walk $W(n), n \in…

Consider a first-come, first-served single server queue with an initial workload $x>0$ and customers who arrive according to an inhomogeneous Poisson process with rate function $\lambda:[0,\infty)\rightarrow[0,\lambda_h ]$ for some…

Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…

Let S_0=0,{S_n, n>0} be a random walk generated by a sequence of i.i.d. random variables X_1,X_2,... and let \tau^{-} be the first descending ladder epoch. Assuming that the distribution of X_1 belongs to the domain of attraction of an…

This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…

Let $(X_n)_{n\geq 0}$ be a Markov chain with values in a finite state space $\mathbb X$ starting at $X_0=x \in \mathbb X$ and let $f$ be a real function defined on $\mathbb X$. Set $S_n=\sum_{k=1}^{n} f(X_k)$, $n\geqslant 1$. For any $y \in…

Let $(Y_n)$ be a sequence of i.i.d. $\mathbb Z$-valued random variables with law $\mu$. The reflected random walk $(X_n)$ is defined recursively by $X_0=x \in \mathbb N_0, X_{n+1}=|X_n+Y_{n+1}|$. Under mild hypotheses on the law $\mu$, it…

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…

We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…

We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…

Even after decades of research the problem of first passage time statistics for quantum dynamics remains a challenging topic of fundamental and practical importance. Using a projective measurement approach, with a sampling time $\tau$, we…

Suppose that $\mathcal C$ is a finite collection of patterns. Observe a Markov chain until one of the patterns in $\mathcal C$ occurs as a run. This time is denoted by $\tau$. In this paper, we aim to give an easy way to calculate the mean…

We study one-dimensional discrete as well as continuous time random walks, either with a fixed number of steps (for discrete time) $n$ or on a fixed time interval $T$ (for continuous time). In both cases, we focus on symmetric probability…

We consider a system of asymmetric independent random walks on $\mathbb{Z}^d$, denoted by $\{\eta_t,t\in{\mathbb{R}}\}$, stationary under the product Poisson measure $\nu_{\rho}$ of marginal density $\rho>0$. We fix a pattern $\mathcal{A}$,…

Lyapunov drift and Lyapunov optimization are powerful techniques for optimizing time averages in stochastic queueing networks subject to stability. However, there are various definitions of queue stability in the literature, and the most…

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line $ (- \infty,0] \times {0}$ before time $n$. Let $X^{(1)}=(X_{1},X_{2})$ be the increment of the two-dimensional random…