A really simple conception of a random walk is that the walker starts at 0 on the number line, then makes consecutive steps, each of which can either be left or right. The probability of left or right can be equal or different. After a certain number of steps, the position of the walker is taken.<\/p>\n
Perl, with its rand() function, facilitates easy simulation of a random walk: Next post I’ll explain this program:)<\/p>\n Sources:<\/p>\n Ross, Sheldon M. Probability Models<\/u>, Fifth Ed. San Diego: Academic Press, Inc., 1993.<\/p>\n McGrath, Mike. Perl in easy steps<\/u>. Southam: Computer Step, 2004.<\/p>\n
\n
\n#!\/usr\/bin\/perl
\nprint “Welcome to the random walk simulation.\\n\\n”;
\nprint “Enter the number of steps you’d like, please.\\n\\n”;
\n$steps=<STDIN>;
\nchomp $steps;
\n$pos=0;
\nfor($i=0;$i<$steps;$i++){
\n$rn=int(rand(100));
\nif($rn % 2==0){
\n$pos=$pos-1;
\n}
\nelse{
\n$pos++;
\n}
\n}
\nif($pos<0){\n$dir=\"left\";\n$pos*=-1;\n}
\nelse{
\n$dir=”right”;
\n}
\nprint “The position, after $steps steps, is $pos units $dir\\n\\n”;
\n<\/span><\/p>\n