English

Ladder Chains: A Variation of Random Walks

Probability 2018-12-10 v1

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=21)(p=\sqrt{2}-1). All approaches of these results can be generalized to solve similar problems for other ladder chains.

Keywords

Cite

@article{arxiv.1812.03059,
  title  = {Ladder Chains: A Variation of Random Walks},
  author = {Chenhe Zhang and Xiang Fang},
  journal= {arXiv preprint arXiv:1812.03059},
  year   = {2018}
}

Comments

14 pages, 2 figures

R2 v1 2026-06-23T06:35:28.985Z