[math-fun] derandomized Galton board
Inspired by some joint investigations I conducted with Steve Witham a year or so ago, I recently did a simulation of an even more natural "derandomized random walk" in the quadrant: see http://jamespropp.org/quincunx.gif This shows what happens when you use a non-random Galton board in which the pins are replaced by flip-flops, so that the 1st marble to arrive at a flip-flop gets routed to the right, the 2nd gets routed to the left, the 3rd gets routed to the right, and so on, in alternation. My quasi-Galton board has 1024 rows, but the picture is rotated by 45 degrees, so the "bottom row" actually appears as a diagonal. Hence: the 1st marble to arrive at a flip-flop gets routed rightward, the 2nd gets routed downward, the 3rd gets routed rightward, and so on. White pixels corresponds to flip-flops that lie outside the board, or have not yet been visited by a marble. Yellow pixels correspond to flip-flops that most recently sent a marble rightward. Blue pixels correspond to flip-flops that most recently sent a marble downward. The nth frame (where the initial frame is considered the 0th) shows the states of the flip-flops (or, as I tend to call them, rotors) after the first n particles have passed beyond the first 1024 rows. When viewed with a suitable browser, quincunx.gif shows the first 1000 steps of what happens to the rotors. (It's kind of small at first, but wait for it: the set of non-white pixels will eventually become big enough to look at without a magnifying glass.) As you can see, patterns spontaneously form and propagate in a kind of Jacob's ladder fashion, with some triangles moving outward and others moving inward, as in Steve's "rounder-router" simulations. I believe this is new, but I won't be surprised if it isn't, since it's such a natural thing to look at. Has anyone seen this before? I've also done some variants of this simulation (changing the initial conditions and in some cases incorporating randomness); I can post them if people are interested. Note that there's another way one might do the simulation that looks superficially different, in which you drop a new marble at (0,0) at each time step, so that after n marbles have been dropped in, there's a single marble in {(i,j): i+j=k} for all k between 0 and n-1. This resulting movie, viewed as a static three-dimensional object, is essentially the same as the movie I created; you're just slicing the space-time object differently using different notions of "time". Perhaps this way of looking at things is more informative; I haven't coded it yet. The object being studied can be written as a fairly simple three- dimensional celluluar automaton with specific simple boundary conditions, so perhaps Wolfram and his crowd know about it already. Any leads or observations will be appreciated! Jim Propp
Jim Propp:
Inspired by some joint investigations I conducted with Steve Witham a year or so ago, I recently did a simulation of an even more natural "derandomized random walk" in the quadrant: see http://jamespropp.org/quincunx.gif This shows what happens when you use a non-random Galton board in which the pins are replaced by flip-flops, so that the 1st marble to arrive at a flip-flop gets routed to the right, the 2nd gets routed to the left, the 3rd gets routed to the right, and so on, in alternation.
I've created a "QuasiGalton" rule for exploring this CA in Golly: http://www.trevorrow.com/golly/QuasiGalton.zip If you're using Golly 2.1 you can open the .zip in Golly and it will automatically install QuasiGalton.tree and QuasiGalton.colors in your rules folder, then run build-galton.py to construct a Galton board pattern (this takes a few secs). The .zip also includes QuasiGalton.txt which contains the Python transition function used to create QuasiGalton.tree via the make-ruletree.py script which can be downloaded from the Rule Table Repository: http://ruletablerepository.googlecode.com/files/make-ruletree.py (This script will be included in Golly 2.2. It makes it very easy to create new rules.) Andrew
* James Propp <jpropp@cs.uml.edu> [Apr 22. 2010 10:15]:
Inspired by some joint investigations I conducted with Steve Witham a year or so ago, I recently did a simulation of an even more natural "derandomized random walk" in the quadrant: see http://jamespropp.org/quincunx.gif
Hack attack by corrupt file? Any attempt to view (or convert) this file lead to death by OOM killer. One prog (kuickshow) said "GIF-LIB error: Wrong record type detected." before spiraling down into eternal swapping.
I had similar problems while attempting to view this file, using a Mac Powerbook with OS 10.3.9. WFL On 4/23/10, Joerg Arndt <arndt@jjj.de> wrote:
* James Propp <jpropp@cs.uml.edu> [Apr 22. 2010 10:15]:
Inspired by some joint investigations I conducted with Steve Witham a year or so ago, I recently did a simulation of an even more natural "derandomized random walk" in the quadrant: see http://jamespropp.org/quincunx.gif
Hack attack by corrupt file?
Any attempt to view (or convert) this file lead to death by OOM killer.
One prog (kuickshow) said "GIF-LIB error: Wrong record type detected." before spiraling down into eternal swapping.
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
participants (4)
-
Andrew Trevorrow -
Fred lunnon -
James Propp -
Joerg Arndt