Discrete random walk with barriers on a locally infinite graph - Mathematics > ProbabilityReport as inadecuate




Discrete random walk with barriers on a locally infinite graph - Mathematics > Probability - Download this document for free, or read online. Document in PDF available to download.

Abstract: We obtain expected number of arrivals, absorption probabilities and expectedtime before absorption for an asymmetric discrete random walk on a locallyinfinite graph in the presence of multiple function barriers



Author: Theo van Uem

Source: https://arxiv.org/







Related documents