Random walk with barriers on a graph

2008/11/22 by Theo van Uem, van Uem, Theo
Computer Science · Mathematics · Physics and Astronomy · #60G50 #60J05 #Complex Network Analysis Techniques #Data Management and Algorithms #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Probability (math.PR) #Statistical Mechanics (cond-mat.stat-mech) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.0811.3682

openalex publication_date 2008/11/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Random walk with equidistant multiple function barriers
• Discrete random walk with geometric absorption
• Modified discrete random walk with absorption
• On Random Walks with Barriers and their Application to Queues
• Random walk on a diagonal lattice with absorbing boundaries