Random walk with barriers on a graph
Probability
2023-07-26 v2 Statistical Mechanics
Mathematical Physics
math.MP
Abstract
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex (barrier) specific probabilities are defined.
Cite
@article{arxiv.0811.3682,
title = {Random walk with barriers on a graph},
author = {Theo van Uem},
journal= {arXiv preprint arXiv:0811.3682},
year = {2023}
}
Comments
Accepted for publication by North-Western European Journal of Mathematics; Number 7 -2021, p 67-79