Article View: sci.math.stat
Article #171random walk
From: Qi Y. Zeng
Date: Thu, 06 Aug 1992 20:14
Date: Thu, 06 Aug 1992 20:14
17 lines
1157 bytes
1157 bytes
Dear Netters:
I have a question about random walk.
Those interested, would you please reply me by e-mail?
The problem is :
If a drunk man start from a position x=0 when time is t=0, in the every
following unit time interval he takes either a right step or a left step and
position of the drunk man is limited to N steps from the starting
point(x=0), we want to know, the drunk man has how many different ways to
arrive at x=i(i<N) when time t=n(n>N)? An expression in terms of N and n
is needed.
This is equivalent to ask the number of random walk in a limited distance.
Thank you for you attention and I am looking forward to receiving your
answers.
Sincerely,
QZ
Technical Details
Message-ID:
<BsKw7K.K0o@acsu.buffalo.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!rutgers!ub!acsu.buffalo.edu!qizengShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!rutgers!ub!acsu.buffalo.edu!qizeng From: qizeng@acsu.buffalo.edu (Qi Y. Zeng) Newsgroups: sci.math.stat Subject: random walk Message-ID: <BsKw7K.K0o@acsu.buffalo.edu> Date: 6 Aug 92 20:14:07 GMT Sender: nntp@acsu.buffalo.edu Organization: UB Lines: 17 Nntp-Posting-Host: autarch.acsu.buffalo.edu