2018/12/07 by Chenhe Zhang, Xiang Fang, Zhang, Chenhe +1
Computer Science · Mathematics · #60G40 #60J75 #Bayesian Methods and Mixture Models #Data Management and Algorithms #FOS: Mathematics #Probability (math.PR) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.1812.03059
openalex publication_date 2018/12/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.