Fast simulation of large-scale growth models

Authors:
Tobias Friedrich;Lionel Levine
Affiliations:
Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany;Massachusetts Institute of Technology, Cambridge, MA
Venue:
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Year:
2011

Citing 10
Cited 0

Generating random spanning trees more quickly than the cover time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Simple randomized mergesort on parallel disks

Parallel Computing - Special double issue: parallel I/O
How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph

Journal of Algorithms
Simulating a Random Walk with Constant Error

Combinatorics, Probability and Computing
Deterministic random walks on the integers

European Journal of Combinatorics
Quasirandom rumor spreading

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic random walks on the two-dimensional grid

Combinatorics, Probability and Computing
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Deterministic random walks on regular trees

Random Structures & Algorithms
Quasirandom load balancing

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.02

Visualization

Abstract

We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process. Starting from an approximation for the odometer, we successively correct under- and overestimates and provably arrive at the correct final state. The degree of speedup depends on the accuracy of the initial guess. Determining the size of the boundary fluctuations in growth models like internal diffusion-limited aggregation (IDLA) is a long-standing open problem in statistical physics. As an application of our method, we calculate the size of fluctuations over two orders of magnitude beyond previous simulations.