Ladder Chains: A Variation of Random Walks
classification
🧮 math.PR
keywords
ladderchainsrandomwalkshittingprobabilityrecurrenceruin
pith:DK4XFPGU Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{DK4XFPGU}
Prints a linked pith:DK4XFPGU badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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=\sqrt{2}-1)$. All approaches of these results can be generalized to solve similar problems for other ladder chains.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.