Goldbug Variations
Michael Kleber
Abstract
This "Mathematical Entertainments" column from the Intelligencer is an exposition of current investigations, rooted in recent work of Jim Propp, into "quasirandom" analogues of random walk and random aggregation processes. Featured are the "Goldbugs" and the "Rotor-router". These are deterministic processes which simulate the random ones, for example having the same limiting states, but with faster convergence. The paper includes three large illustrations, which appear twice in the submission, as both raster image (.png) and postscript (.eps) files. The latter are much larger but needed for latex inclusion; the former are smaller, used by pdflatex, and better for pixel-level viewing.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.