Ladder Chains: A Variation of Random Walks

Abstract

The authors propose a new variation of random walks called ladder chains L(r,s,p). We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take L(2,2,p) for instance, we find the linear difference equations that the ruin probability and the hitting time satisfy. We also prove the recurrence of a critical case (p=2-1). All approaches of these results can be generalized to solve similar problems for other ladder chains.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…