2000 character limit reached
Ladder Chains: A Variation of Random Walks
Published 7 Dec 2018 in math.PR | (1812.03059v1)
Abstract: The authors propose a new variation of random walks called ladder chains . We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take 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 . All approaches of these results can be generalized to solve similar problems for other ladder chains.
Paper Prompts
Sign up for free to create and run prompts on this paper.