No. of 2-D random walks of fixed length

Thread View: sci.stat.math

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by David L Dowe Fri, 13 Oct 1995 00:00

#26

Author: David L Dowe
Date: Fri, 13 Oct 1995 00:00

19 lines
1452 bytes

   The 1-dimensional random walk, be it along a continuum or at the
discrete, integer-valued points, is guaranteed (with probability 1)
to visit each point infinitely often.

   The number of ways that the 1-D random walk can have length (2m + 1)
is of the order of the Catalan number, (2m)!/(m! (m+1)!) .

I use an odd (non-even) length, 2m+1, above since I wish to stop the
walk above on the first occasion it steps immediately left after a
return to the origin.


Let us now consider a 2-D walk, which we shall say terminates (e.g.)
upon first return to the origin.

What is the number of ways that such a walk can have length l ?


Thanks.   - David Dowe.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads