Random walk with barriers on a graph
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2008
- DOI:
- arXiv:
- arXiv:0811.3682
- Bibcode:
- 2008arXiv0811.3682V
- Keywords:
-
- Mathematics - Probability;
- Condensed Matter - Statistical Mechanics;
- Mathematical Physics;
- 60G50;
- 60J05
- E-Print:
- Accepted for publication by North-Western European Journal of Mathematics