Cellular automata on graphs with random topologies where each node has k neighbors with k proportional to log(n) achieve consensus convergence time of O(log n / log log n), which is faster than high-dimensional grid topologies and represents the information-theoretic lower bound because the diameter of such graphs scales as log(n) / log(k-1)