arXiv Analytics

Sign in

arXiv:0811.3682 [math.PR]AbstractReferencesReviewsResources

Random walk with barriers on a graph

Theo van Uem

Published 2008-11-22, updated 2023-07-25Version 2

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.

Comments: Accepted for publication by North-Western European Journal of Mathematics; Number 7 -2021, p 67-79
Subjects: 60G50, 60J05
Related articles: Most relevant | Search more
arXiv:0903.0364 [math.PR] (Published 2009-03-02)
Modified discrete random walk with absorption
arXiv:0909.4490 [math.PR] (Published 2009-09-24)
Critical percolation: the expected number of clusters in a rectangle
arXiv:0901.0469 [math.PR] (Published 2009-01-05, updated 2023-07-25)
Random walk and Fibonacci matrices

Links

Toolbox