Computational Complexity of Avalanches in the Kadanoff Sandpile Model

This paper investigates the avalanche problem AP for the Kadanoff sandpile model (KSPM). We prove that (a slight restriction of) AP is in NC1 in dimension one, leaving the general case open. Moreover, we prove that AP is P-complete in dimension two. The proof of this latter result is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with an initial sand distribution in KSPM. These results are also related to the known prediction problem for sandpiles which is in NC1 for one-dimensional sandpiles and P-complete for dimension 3 or higher. The computational complexity of the prediction problem remains open for the Bak's model of two-dimensional sandpiles.

[1]  Kévin Perrot,et al.  Avalanche Structure in the Kadanoff Sand Pile Model , 2011, LATA.

[2]  Eric Goles Ch.,et al.  Universality of the Chip-Firing Game , 1997, Theor. Comput. Sci..

[3]  Wu,et al.  Scaling and universality in avalanches. , 1989, Physical review. A, General physics.

[4]  Eric Goles Ch.,et al.  Crossing information in two-dimensional Sandpiles , 2006, Theor. Comput. Sci..

[5]  Peter Bro Miltersen.  The Computational Complexity of One-Dimensional Sandpiles , 2006, Theory of Computing Systems.

[6]  Martin Nilsson,et al.  The Computational Complexity of Sandpiles , 1999 .

[7]  Enrico Formenti,et al.  From sandpiles to sand automata , 2007, Theor. Comput. Sci..

[8]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[9]  Eric Goles Ch.,et al.  Sandpiles and order structure of integer partitions , 2002, Discret. Appl. Math..

[10]  Eric Goles Ch.,et al.  The structure of a linear chip firing game and related models , 2002, Theor. Comput. Sci..

[11]  Dominique Rossin,et al.  Bidimensionnal sand pile and ice pile models , 2006 .

[12]  P. Bak,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[13]  Maurice Margenstern,et al.  SAND PILE AS A UNIVERSAL COMPUTER , 1996 .

[14]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[15]  Pierre Guillon,et al.  Sand automata as cellular automata , 2009, Theor. Comput. Sci..