Discrete random walk with barriers on a locally infinite graph
Résumé
We obtain expected number of arrivals, absorption probabilities and expected time before absorption for an asymmetric discrete random walk on a locally infinite graph in the presence of multiple function barriers