Hitting probabilities of constrained random walks representing tandem networks

From MaRDI portal
Publication:6367459

arXiv2105.05474MaRDI QIDQ6367459FDOQ6367459

Ali Devin Sezer

Publication date: 12 May 2021

Abstract: Let X be the constrained random walk on mathbbZ+d d>2, having increments e1, ei+ei+1 i=1,2,3,...,d1 and ed with probabilities lambda, mu1, mu2,...,mud, where e1,e2,..,ed are the standard basis vectors. The process X is assumed stable, i.e., lambda<mui for all i=1,2,3,...,d. Let aun be the first time the sum of the components of X equals n. We derive approximation formulas for the probability mathbbPx(aun<au0). For and a sequence of initial points xn/nightarrowx we show that the relative error of the approximation decays exponentially in n. The approximation formula is of the form mathbbPy(au<infty) where au is the first time the sum of the components of a limit process Y is 0; Y is the process X as observed from a point on the exit boundary except that it is unconstrained in its first component (in particular Y is an unstable process); Y and mathbbPy(au<infty) arise naturally as the limit of an affine transformation of X and the probability mathbbPx(aun<au0). The analysis of the relative error is based on a new construction of supermartingales. We derive an explicit formula for mathbbPy(au<infty) in terms of the ratios lambda/mui which is based on the concepts of harmonic systems and their solutions and conjugate points on a characteristic surface associated with the process Y; the derivation of the formula assumes muieqmuj for ieqj.












This page was built for publication: Hitting probabilities of constrained random walks representing tandem networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367459)