Generalized sandpile model and the characterization of the existence of self-organized criticality

1991 ◽  
Vol 44 (10) ◽  
pp. 6233-6240 ◽  
Author(s):  
H. F. Chau ◽  
K. S. Cheng
2000 ◽  
Vol 11 (06) ◽  
pp. 1257-1262 ◽  
Author(s):  
COLIN CHISHOLM ◽  
NAEEM JAN ◽  
PETER GIBBS ◽  
AYŞE ERZAN

Recent work has shown that the distribution of steady state mutations for an asexual "bacteria" model has features similar to that seen in Self-Organized Critical (SOC) sandpile model of Bak et al. We investigate this coincidence further and search for "self-organized critical" state for bacteria but instead find that the SOC sandpile critical behavior is very sensitive; critical behavior is destroyed with small perturbations effectively when the absorption of sand is introduced. It is only in the limit when the length of the genome of the bacteria tends to infinity that SOC properties are recovered for the asexual model.


1994 ◽  
Vol 367 ◽  
Author(s):  
S. Zapperi ◽  
A. Vespignanit ◽  
L. Pietronero

AbstractWe have introduced a new renormalization group approach that allows us to describe the critical stationary state of sandpile models (Phys. Rev. Lett. 72, 1690 (1994)). We define a characterization of the phase space in order to study the evolution of the dynamics under a change of scale. We obtain a non trivial actractive fixed point for the parameters of the model that clarifys the self organized critical nature of these models. We are able to compute the values of the critical exponents and the results are in good agreement with computer simulations. The method can be naturally extended to several other problems with non equilibrium stationary state.


Author(s):  
Paul Charbonneau

This chapter describes a simple computational idealization of a sandpile. When sand trickles slowly through your fingers, a small conical pile of sand forms below your hand. Sand avalanches of various sizes intermittently slide down the slope of the pile, which is growing both in width and in height but maintains the same slope angle. The pile of sand is a classic example of self-organized criticality. The chapter first provides an overview of the sandpile model before discussing its numerical implementation and a representative simulation involving a small 100-node lattice. It then examines the invariant power-law behavior of avalanches and the self-organized criticality of a sandpile. The chapter includes exercises and further computational explorations, along with a suggested list of materials for further reading.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Ziv Scully ◽  
Tian-Yi Jiang ◽  
Yan Zhang

International audience The $\textit{parallel chip-firing game}$ is an automaton on graphs in which vertices "fire'' chips to their neighbors. This simple model, analogous to sandpiles forming and collapsing, contains much emergent complexity and has connections to different areas of mathematics including self-organized criticality and the study of the sandpile group. In this work, we study $\textit{firing sequences}$, which describe each vertex's interaction with its neighbors in this game. Our main contribution is a complete characterization of the periodic firing sequences that can occur in a game, which have a surprisingly simple combinatorial description. We also obtain other results about local behavior of the game after introducing the concept of $\textit{motors}$. Le $\textit{parallel chip-firing game}$, c’est une automate sur les graphiques, dans lequel les sommets “tirent” des jetons à leurs voisins. Ce modèle simple, semblable aux tas de sable qui forment et s’affaissent, contient beaucoup de complexité émergente et a des connections avec différents domaines de mathématiques, incluant le $\textit{self-organized criticality}$ et l’étude du $\textit{sandpile group}$. Dans ce projet, on étudie les $\textit{firing sequences}$, qui décrivent les interactions de chaque sommet avec ses voisins dans le jeu. Notre contribution principale est une caractérisation complète des séquences de tir qui peuvent arriver dans une jeu, qui ont une description combinatoire assez simple. Nous obtenonsaussi d'autres résultats sur le conduite locale du jeu après l’introduction du concept des $\textit{motors}$.


Sign in / Sign up

Export Citation Format

Share Document