i am tying to analyze a random walk on an integer lattice \(\displaystyle \mathbb{Z}^k\). for \(\displaystyle k=1\), what is the probability that after \(\displaystyle n\) steps the drunkard's distance from the origin is lower than \(\displaystyle \sqrt{n}\)?
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an alternative browser.
You should upgrade or use an alternative browser.
Random (drankard) walk distance after n steps
- Thread starter MrRoth
- Start date
D
Deleted member 4993
Guest
i am tying to analyze a random walk on an integer lattice \(\displaystyle \mathbb{Z}^k\). for \(\displaystyle k=1\), what is the probability that after \(\displaystyle n\) steps the drunkard's distance from the origin is lower than \(\displaystyle \sqrt{n}\)?
Many a dissertation has been written on this topic. What are your thoughts?
Please share your work with us, indicating exactly where you are stuck - so that we may know where to begin to help you.
D
Deleted member 4993
Guest
i am self learning the topic. i thought that one could shed the light over it with details explanation.
Use Google...