Hitting probabilities of constrained random walks representing tandem networks
Abstract
Let X be the constrained random walk on Z+d d >2, having increments e1, -ei+ei+1 i=1,2,3,...,d-1 and -ed with probabilities λ, μ1, μ2,...,μd, where \e1,e2,..,ed\ are the standard basis vectors. The process X is assumed stable, i.e., λ < μi for all i=1,2,3,...,d. Let τn be the first time the sum of the components of X equals n. We derive approximation formulas for the probability Px(τn < τ0). For x ∈ i=1d \x ∈ Rd+: Σj=1i x(j) > (1 - λ/ μi λ/μi) \ and a sequence of initial points xn/n → x we show that the relative error of the approximation decays exponentially in n. The approximation formula is of the form Py(τ < ∞) where τ 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 Py(τ< ∞) arise naturally as the limit of an affine transformation of X and the probability Px(τn < τ0). The analysis of the relative error is based on a new construction of supermartingales. We derive an explicit formula for Py(τ < ∞) in terms of the ratios λ/μi 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 μi ≠ μj for i≠ j.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.