Random walk and Fibonacci matrices

Theo van Uem

Published 2009-01-05, updated 2023-07-25Version 2

We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected time until absorption using a new concept: Fibonacci matrices.