Related papers: Computational complexity of the avalanche problem …
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work…
Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is…
We derive the steady state properties of a general directed ``sandpile'' model in one dimension. Using a central limit theorem for dependent random variables we find the precise conditions for the model to belong to the universality class…
We study the abelian sandpile model on decorated one dimensional chains. We determine the structure and the asymptotic form of distribution of avalanche-sizes in these models, and show that these differ qualitatively from the behavior on a…
We consider the Bak-Tang-Wiesenfeld sandpile model on square lattices in different dimensions (D>=6). A finite size scaling analysis of the avalanche probability distributions yields the values of the distribution exponents, the dynamical…
We describe the surface properties of a simple lattice model of a sandpile that includes evolving structural disorder. We present a dynamical scaling hypothesis for generic sandpile automata, and additionally explore the kinetic roughening…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…
We study the saddle-points of the $p$-spin model -- the best understood example of a `complex' (rugged) landscape -- when its $N$ variables are complex. These points are the solutions to a system of $N$ random equations of degree $p-1$. We…
Sand pile models are dynamical systems emphasizing the phenomenon of Self Organized Criticality (SOC). From N stacked grains, iterating evolution rules leads to some critical configuration where a small disturbance has deep consequences on…
The two dimensional directed sandpile with dissipation is transformed into a (1+1) dimensional problem with discrete space and continuous `time'. The master equation for the conditional probability that K grains preserve their initial order…
We use a discrete-time formulation to study the asymmetric avalanche process [Phys. Rev. Lett. vol. 87, 084301 (2001)] on a finite ring and obtain an exact expression for the average avalanche size of particles as a function of toppling…
We prove a necessary and sufficient condition for an Abelian Sandpile Model (ASM) to be avalanche-finite, namely: all unstable states of the system can be brought back to stability in finite number of topplings. The method is also…
Sand pile models are dynamical systems describing the evolution from $N$ stacked grains to a stable configuration. It uses local rules to depict grain moves and iterate it until reaching a fixed configuration from which no rule can be…
We study the two-dimensional Abelian Sandpile Model on a square lattice of linear size L. We introduce the notion of avalanche's fine structure and compare the behavior of avalanches and waves of toppling. We show that according to the…
The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that…
We study the directed Abelian sandpile model on a square lattice, with $K$ downward neighbors per site, $K > 2$. The $K=3$ case is solved exactly, which extends the earlier known solution for the $K=2$ case. For $K>2$, the avalanche…
Consider the Abelian sandpile measure on $\mathbb{Z}^d$, $d \ge 2$, obtained as the $L \to \infty$ limit of the stationary distribution of the sandpile on $[-L,L]^d \cap \mathbb{Z}^d$. When adding a grain of sand at the origin, some region,…
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
We consider the Bak-Tang-Wiesenfeld sandpile model on a two-dimensional square lattice of lattice sizes up to L=4096. A detailed analysis of the probability distribution of the size, area, duration and radius of the avalanches will be…