A Restricted Random Walk defined via a Fibonacci Process
School of Education
University of Manchester
In this article we study a random walk on a particularly simple graph.
This walk is determined by a probabilistic process associated with the
Fibonacci sequence. Exact formulas are derived for the expected
proportions of time spent on each arc of the graph for a walk of length
n, giving rise to sequences that do not appear in Sloane's On-Line
Encyclopedia of Integer Sequences. We also obtain asymptotic relations
for these expected proportions.
Full version: pdf,
(Concerned with sequences
Received October 10 2010;
revised version received April 24 2011.
Published in Journal of Integer Sequences, May 2 2011.
Journal of Integer Sequences home page