This paper considers the QBD approximation of a special class of two-dimensional reflecting random walks (2D-RRWs). A typical example of the 2D-RRWs is a two-node Jackson network with cooperative servers. The main contribution of this paper is to provide simple upper bounds for the relative absolute difference between the time-averaged functionals of the original 2D-RRW and its QBD approximation.
Markov modulation is versatile in generalization for making a simple stochastic model which is often analytically tractable to be more flexible in application. In this spirit, we modulate a two dimensional reflecting skip-free random walk in such a way that its state transitions in the boundary faces and interior of a nonnegative integer quadrant are controlled by Markov chains. This Markov modulated model is referred to as a 2d-QBD process according to Ozaw (2013). We are interested in the tail asymptotics of its stationary distribution, which has been well studied when there is no Markov mod…
We consider a neighbourhood random walk on a quadrant, $\{(X_1(t),X_2(t),φ(t)):t\geq 0\}$, with state space \begin{eqnarray*} \mathcal{S}&=&\{(n,m,i):n,m=0,1,2,\ldots;i=1,2,\ldots,k(n,m)\}. \end{eqnarray*} Assuming start in state $(n,m,i)$, the process spends exponentially distributed amount of time in $(n,m,i)$ according to some parameter $λ_i^{(n,m)}$. Upon leaving state $(n,m,i)$ the process moves to some state $(n^{'},m^{'},j)$ with $j\in\{1,\ldots,k(n^{'},m^{'})\}$ and $n^{'}\in\{n-1,n,n+1\}$, $m^{'}\in\{m-1,m,m+1\}$, according to some probabilities $(p_{n;a}^{m;b})_{i,j}$ with $a,b\in\{+…
We consider a discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process for short) $\{(\boldsymbol{X}_n,J_n)\}$ on $\mathbb{Z}_+^2\times S_0$, where $\boldsymbol{X}_n=(X_{1,n},X_{2,n})$ is the level state, $J_n$ the phase state (background state) and $S_0$ a finite set, and study asymptotic properties of the stationary tail distribution. The 2d-QBD process is an extension of usual one-dimensional QBD process. By using the matrix analytic method of the queueing theory and the complex analytic method, we obtain the asymptotic decay rate of the stationary tail distribution in an…
We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics for the stationary probabilities on the coordinate axis. This refines the asymptotic results in the literature, and completely solves the tail asymptotic problem on the stationary marginal distributions in the coordinate and diagonal directions. For this, we use the so-called analytic function method in such a way that either generating functions or moment g…
A discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process), $\{\boldsymbol{Y}_n\}=\{(X_{1,n},X_{2,n},J_n)\}$, is a two-dimensional skip-free random walk $\{(X_{1,n},X_{2,n})\}$ on $\mathbb{Z}_+^2$ with a supplemental process $\{J_n\}$ on a finite set $S_0$. The supplemental process $\{J_n\}$ is called a phase process. The 2d-QBD process $\{\boldsymbol{Y}_n\}$ is a Markov chain in which the transition probabilities of the two-dimensional process $\{(X_{1,n},X_{2,n})\}$ vary according to the state of the phase process $\{J_n\}$. This modulation is assumed to be space homogene…
We deal with a discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process for short) on $\mathbb{Z}_+^2\times S_0$, where $S_0$ is a finite set, and give a complete expression for the asymptotic decay function of the stationary tail probabilities in an arbitrary direction. The 2d-QBD process is a kind of random walk in the quarter plane with a background process. In our previous paper (Queueing Systems, vol. 102, pp. 227-267, 2022), we have obtained the asymptotic decay rate of the stationary tail probabilities in an arbitrary direction and clarified that if the asymptotic dec…
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. It is assumed that this reflecting random walk has skip free transitions. We are concerned with its time reversed process assuming that the stationary distribution exists. In general, the time reversed process may not be a reflecting random walk. In this paper, we derive necessary and sufficient conditions for the time reversed process also to be a reflecting random walk. These conditions are different from but closely related to the product form of the stationary distribution.
In this paper, we consider the $(1,R)$ state-dependent reflecting random walk (RW) on the half line, allowing the size of jumps to the right at maximal $R$ and to the left only 1. We provide an explicit criterion for positive recurrence and the explicit expression of the stationary distribution based on the intrinsic branching structure within the walk. As an application, we obtain the tail asymptotic of the stationary distribution in the "near critical" situation.
In this paper, we consider the $(L,1)$ state-dependent reflecting random walk (RW) on the half line, which is a RW allowing jumps to the left at a maxial size $L$. For this model, we provide an explicit criterion for (positive) recurrence and an explicit expression for the stationary distribution.As an application, we prove the geometric tail asymptotic behavior of the stationary distribution under certain conditions. The main tool employed in the paper is the intrinsic branching structure within the $(L,1)$-random walk.
In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as $k\to\infty$, by simple random walks on "maximal connected" subsets of $(2^{-k}\mathbb{Z}^d)\cap D$ whose filled-in interiors are inside of D.
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary of the quadrant, but may have unbounded jumps in the opposite direction, which are referred to as upward jumps. We are interested in the tail asymptotic behavior of its stationary distribution, provided it exists. Assuming the upward jump size distributions have light tails, we completely find the rough tail asymptotics of the marginal stationary distributions in all directions. This generalizes the corresponding results for the …
Let $\{\boldsymbol{X}_n\}$ be a discrete-time $d$-dimensional process on $\mathbb{Z}_+^d$ with a supplemental (background) process $\{J_n\}$ on a finite set and assume the joint process $\{\boldsymbol{Y}_n\}=\{(\boldsymbol{X}_n,J_n)\}$ to be Markovian. Then, the process $\{\boldsymbol{X}_n\}$ can be regarded as a kind of reflecting random walk (RRW for short) in which the transition probabilities of the RRW are modulated according to the state of the background process $\{J_n\}$; we assume this modulation is space-homogeneous inside $\mathbb{Z}_+^d$ and on each boundary face of $\mathbb{Z}_+^d…
We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{β^+}$ and $x_2 = -a^- x_1^{β^-}$, with $x_1 \geq 0$. In the interior of the domain, the random walk has zero drift and a given increment covariance matrix. From the vicinity of the upper and lower sections of the boundary, the walk drifts back into the interior at a given angle $α^+$ or $α^-$ to the relevant inwards-pointing normal vector. Here we focus on the case where $α^+$ and $α^-$ are equal but opposite, which includes the case of normal reflection. Fo…
Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified position. One-dimensional reflected random walk is quite well understood from work in 7 decades, but the multidimensional model presents several new difficulties. Here we investigate recurrence questions.
We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of customers) can hold at most one customer at a time and there is no waiting room. Upon arrival, if a type $i$ customer $(i=1,2)$ finds a busy server, it will join the type $i$ orbit. After an exponential time with a constant (retrial) rate $μ_i$, an type $i$ customer attempts to get service. This model has been recently studied by Avrachenkov, Nain and Yechiali~\c…
In this paper, we consider the state-dependent reflecting random walk on a half-strip. We provide explicit criteria for (positive) recurrence, and an explicit expression for the stationary distribution. As a consequence, the light-tailed behavior of the stationary distribution is proved under appropriate conditions. The key idea of the method employed here is the decomposition of the trajectory of the random walk and the main tool is the intrinsic branching structure buried in the random walk on a strip, which is different from the matrix-analytic method.
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in which the allowed step sizes take values in the set $\{\pm1,\pm2,\ldots,\pm k\}$, a process we call a random leap. The need to analyze such models arises naturally in modern-day data science and so-called "big data" applications. We provide closed-form expressions for quantities associated with first passage times and absorption events of random leaps. These …
We consider a one-dimensional discrete symmetric random walk with a reflecting boundary at the origin. Generating functions are found for the 2- dimensional probability distribution P{Sn = x,max1?j?n Sn = a} of being at position x after n steps, while the maximal location that the walker has achieved during these n steps is a. We also obtain the familiar (marginal) 1-dimensional distribution for Sn = x, but more importantly that for max1?j?n Sj = a asymptotically at fixed a2/n. We are able to compute and compare the expectations and variances of the two one-dimensional distributions, finding t…
We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0 and first return time to 0, and the probability of being at a given height k at time n (uniformly in a large range of k.) In particular, for drift of form -δ/2x + o(1/x) with δ> -1, we show that the probability of a first return to 0 at time n is asymptotically n^{-c}ϕ(n), where c = (3+δ)/2 and ϕis a slowly varying function given explicitly in terms of the o(…
Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk on a supercritical percolation cluster or among random conductances bounded uniformly from below in a half-space, quarter-space, etc., converges when rescaled diffusively to a reflecting Brownian motion, which has been one of the important open problems in this area. We establish a similar result for the random conductance model in a box, which allows us to…
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to a reflecting Brownian bridge. Two different ways to encode a mapping as a walk lead to two different decompositions of the Brownian bridge, each defined by cutting the path of the bridge at an increasing sequence of recursively defined random times in the zero set of the bridge. The random mapping asymptotics entail some remarkable identities involving the r…
We consider the multi-time correlation and covariance structure of a random surface growth with a wall introduced in arXiv:0904.2607. It is shown that the correlation functions associated with the model along space-like paths have determinantal structure, which yields the convergence of height fluctuations to that of a Gaussian free field. We also construct a continuous-time non-commutative random walk on $U(\mathfrak{so}_{N+1})$, which matches the random surface growth when restricting to the Gelfand-Tsetlin subalgebra of $U(\mathfrak{so}_{N+1})$. As an application, we prove the convergence o…
We investigate an insurance risk model that consists of two reserves which receive income at fixed rates. Claims are being requested at random epochs from each reserve and the interclaim times are generally distributed. The two reserves are coupled in the sense that at a claim arrival epoch, claims are being requested from both reserves and the amounts requested are correlated. In addition, the claim amounts are correlated with the time elapsed since the previous claim arrival. We focus on the probability that this bivariate reserve process survives indefinitely. The infinite- horizon survival…
We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $μ>0$ of initially active particles, each of which performs a simple symmetric random walk at rate one and falls asleep at rate $λ>0.$ Sleepy particles become active on coming in contact with other active particles. There have been several recent results concerning fixation/non-fixation of the ARW dynamics on infinite systems depending on the parameters $μ$ and $λ$. On the finite graph $\mathbb{Z}/n\mathbb{Z}$, unless there are more than $n$ p…
Ballistic Speed and Potential-Theoretic Recurrence for Homogeneous Open Quantum Random Walks
Politecnico di Milano（米兰理工大学）；University College, Yonsei University（延世大学校）；United Arab Emirates University（阿联酋大学）；Hankyong National University（韩国汉阳女子大学）
We consider two species of particles performing random walks in a domain in $\mathbb{R}^d$ with reflecting boundary conditions, which annihilate on contact. In addition, there is a conservation law so that the total number of particles of each type is preserved: When the two particles of different species annihilate each other, particles of each species, chosen at random, give birth. We assume initially equal numbers of each species and show that the system has a diffusive scaling limit in which the densities of the two species are well approximated by the positive and negative parts of the so…
