脚本宝典收集整理的这篇文章主要介绍了简易版本Random Walk证明,脚本宝典觉得挺不错的,现在分享给大家,也给大家做个参考。
作业,存档一下过程
Imagine a drunken man who, starting out leaning against a lamp post in the middle of an oPEn space, takes a series of steps of the same length: 1 meter . The direction of these steps is randoMLy chosen From North, South, East or West. After n steps, how far (*d*), generally speaking, is the man from the lamp post? Note that d is the Euclidean distance of the man from the lamp-post. Deduce the relationship.
Just a apPRoximation of the result.
To get to the conclusion of
We consider the drunken man walking in a coordinate System and the lamp spot as the origin,
then we will get his posITion as (x,y)
and the distance will be
And we assume him walking on
West-East direction (x axis) for i steps
North-south direction (y axis) for k steps
Then we will have
If we see Xa/Ya represent the steps as -1/1 for opposite direction.
each XaXa pair will be within the following types:
and the probability of these pairs will be the same because it's Random
On average will be 0,
Therefore,
the same procedure may be easily adapted to Y²
So, we can approxiMATEly deduce that
QED
以上是脚本宝典为你收集整理的简易版本Random Walk证明全部内容,希望文章能够帮你解决简易版本Random Walk证明所遇到的问题。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。