Nearly Tight Bounds for Sandpile Transience on the Grid

We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete process on graphs that is intimately related to the phenomenon of self-organized criticality. In this process, vertices receive grains of sand, and once the number of grains exceeds their degree, they topple by sending grains to their neighbors. The transience class of a model is the maximum number of grains that can be added to the system before it necessarily reaches its steady-state behavior or, equivalently, a recurrent state. Through a more refined and global analysis of electrical potentials and random walks, we give an O(n4 log4 n) upper bound and an Ω(n4) lower bound for the transience class of the n × n grid. Our methods naturally extend to nd-sized d-dimensional grids to give O(n3d-2 logd+2 n) upper bounds and Ω(n3d-2) lower bounds.

[1]  Gunnar Pruessner,et al.  25 Years of Self-organized Criticality: Concepts and Controversies , 2015, 1504.04991.

[2]  Dana Randall,et al.  Approximately Sampling Elements with Fixed Rank in Graded Posets , 2016, SODA.

[3]  Thomas Kron,et al.  Society as a Self-Organized Critical System , 2009, Cybern. Hum. Knowing.

[4]  F. A. Hayek.  The American Economic Review , 2007 .

[5]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[6]  Aleksander Madry,et al.  Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[7]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[8]  Hendrik B. Geyer,et al.  Journal of Physics A - Mathematical and General, Special Issue. SI Aug 11 2006 ?? Preface , 2006 .

[9]  V. Chandrasekar,et al.  Introduction to probability and random processes , 1998 .

[10]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

[11]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[12]  Alessandro Pluchino,et al.  Modeling financial markets by self-organized criticality. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  David M. Raup,et al.  How Nature Works: The Science of Self-Organized Criticality , 1997 .

[14]  F. Spieksma,et al.  Effective graph resistance , 2011 .

[15]  C. Aegerter,et al.  Avalanches and Self-Organized Criticality in superconductors , 2005, cond-mat/0510500.

[16]  P. R. Stein,et al.  The combinatorics of random walk with absorbing barriers , 1977, Discret. Math..

[17]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[18]  D. Dhar,et al.  Algebraic aspects of Abelian sandpile models , 1995 .

[19]  S. S. Manna.  Two-state model of self-organized criticality , 1991 .

[20]  E Altshuler,et al.  Avalanche prediction in a self-organized pile of beads. , 2008, Physical review letters.

[21]  David B Wilson,et al.  Dimension of the loop-erased random walk in three dimensions. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Nisheeth K. Vishnoi,et al.  On a Natural Dynamics for Linear Programming , 2015, ITCS.

[23]  Nisheeth K. Vishnoi,et al.  IRLS and Slime Mold: Equivalence and Convergence , 2016, ArXiv.

[24]  Giorgio Parisi,et al.  Physica A: Statistical Mechanics and its Applications: Editorial note , 2005 .

[25]  Kurt Mehlhorn,et al.  Physarum can compute shortest paths , 2011, SODA.

[26]  Kurt Mehlhorn,et al.  Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds , 2013, ICALP.

[27]  S. Mineshige,et al.  Is a Black Hole Accretion Disk in a Self-organized Critical State? , 1994 .

[28]  Lionel Levine,et al.  Mixing time and eigenvalues of the abelian sandpile Markov chain , 2015, Transactions of the American Mathematical Society.

[29]  J. M. Herrmann,et al.  Dynamical synapses causing self-organized criticality in neural networks , 2007, 0712.1003.

[30]  László Babai,et al.  Sandpile transience on the grid is polynomially bounded , 2007, SODA '07.

[31]  M. Aschwanden,et al.  Self-Organized Criticality in Astrophysics: The Statistics of Nonlinear Processes in the Universe , 2011 .

[32]  In and Out of Equilibrium 2 , 2008 .

[33]  D. Dhar.  Theoretical studies of self-organized criticality , 2006 .

[34]  David B. Wilson,et al.  Chip-Firing and Rotor-Routing on Directed Graphs , 2008, 0801.3306.

[35]  M. Moret,et al.  Self-organized critical phenomenon as a q-exponential decay: avalanche epidemiology of dengue , 2014 .

[36]  V. Latora,et al.  Self-Organized Criticality and earthquakes , 2007, 0711.1750.

[37]  October I.  Physical Review Letters , 2022 .

[38]  Jorge Stolfi,et al.  Phase transitions and self-organized criticality in networks of stochastic spiking neurons , 2016, Scientific Reports.

[39]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[40]  J. C. Phillips,et al.  Fractals and self-organized criticality in proteins , 2014 .

[41]  Dhar,et al.  Self-organized critical state of sandpile automaton models. , 1990, Physical review letters.

[42]  Sundar Vishwanathan,et al.  Random walks, electric networks and the transience class problem of sandpiles , 2012, SODA.

[43]  Akshay Ramachandran,et al.  Sandpile prediction on a tree in near linear time , 2017, SODA.