One dimensional random walk killed on a finite set
Abstract
We study the transition probability, say pAn(x,y), of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set A. The random walk is assumed to be irreducible and have zero mean and a finite variance σ2. We derive the asymptotic form of pAn(x, y) for large n valid uniformly in the regime characterized by the conditions |x| |y| =O( n) and |x| |y|= o( n), in which pAt( x, y) behaves for large n like [gA+(x) gA\,+(y) + gA-(x) gA\,-(y)] (σ2/2n) pn(y-x). Here pn(y-x) is the transition kernel of the random walk (without killing); gA are the Green functions for the "exterior" of A with "pole at ∞" normalized so that gA(x) 2|x|/σ2 as x ∞; and gA\, are the corresponding Green functions for the time-reversed walk.
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.