Papers
Topics
Authors
Recent
Search
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 L(r,s,p)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)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)(p=\sqrt{2}-1). All approaches of these results can be generalized to solve similar problems for other ladder chains.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.