News for hackers. Stuff that matters.
Re:Random walk illustrated with D3 by mikeash on Sunday February 10, 2013 @04:37PM (#5198024)
Interesting fact about the interesting facts at the bottom: each point is reached an infinite number of times only when a random walk is performed in one or two-dimensional space. For dimensions >=3, an infinite walk visits each point a finite number of times, which means that, while the random walker may return to the starting point one or more times after starting, it will eventually wander off forever. This has been described as, "A drunk man will find his way home, but a drunk bird may get lost forever."
Re:Random walk illustrated with D3 by jeffwass on Sunday February 10, 2013 @07:01PM (#5198557)
Or, in human terms, you can eventually find your car in a 2D parking lot, but not a 3D parking garage (as per Seinfeld http://en.wikipedia.org/wiki/The_Parking_Garage)
Re:Random walk illustrated with D3 by mturmon on Monday February 11, 2013 @12:55AM (#5199593)
I had forgotten that one. You inspired me to visit Wikipedia where I learned that the probability of a 3D random walk returning to the origin (given an unbounded number of steps) is about .34 (in 2D, as you note, this probability is 1). The probability of eventual return goes down as dimensionality increases. As you say, get lost forever.