Related papers: Computational complexity of the avalanche problem …
We present and analyse in this paper three models of coupled continuum equations all united by a common theme: the intuitive notion that sandpile surfaces are left smoother by the propagation of avalanches across them. Two of these concern…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence…
Multiple avalanches, initiated by simultaneously toppling neighbouring sites, are studied in three different directed sandpile models. It is argued that, while the single avalanche exponents are different for the three models, a suitably…
In a sandpile model addition of a hole is defined as the removal of a grain from the sandpile. We show that hole avalanches can be defined very similar to particle avalanches. A combined particle-hole sandpile model is then defined where…
We survey the average-case complexity of problems in NP. We discuss various notions of good-on-average algorithms, and present completeness results due to Impagliazzo and Levin. Such completeness results establish the fact that if a certain…
We present a detailed analysis of large scale simulations of avalanches in the 2D Abelian sandpile model. We compare statistical properties of two different decompositions of avalanches into clusters of topplings and waves of topplings.…
We study here a variant of the Abelian Sandpile Model, where the playground is a cylinder of width $w$ and of circumference c. When c << w, we describe a phenomenon which has not been observed in other geometries: the probability…
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Large scale computer simulations are presented to investigate the avalanche statistics of sand piles using molecular dynamics. We could show that different methods of measurement lead to contradicting conclusions, presumably due to…
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis…
We introduce a sandpile model where, at each unstable site, all grains are transferred randomly to downstream neighbors. The model is local and conservative, but not Abelian. This does not appear to change the universality class for the…
The main result of this paper, called the Avalanche Principle (AP), relates the expansion of a long product of matrices with the product of expansions of the individual matrices. This principle was introduced by M. Goldstein and W. Schlag…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
We examine probability distribution for avalanche sizes observed in self-organized critical systems. While a power-law distribution with a cutoff because of finite system size is typical behavior, a systematic investigation reveals that it…
We consider the directed Abelian sandpile model in the presence of sink sites whose density f_t at depth t below the top surface varies as c~1/t^chi. For chi>1 the disorder is irrelevant. For chi<1, it is relevant and the model is no longer…
We analyse by numerical simulations and scaling arguments the avalanche statistics of 1-dimensional elastic interfaces in random media driven at a single point. Both global and local avalanche sizes are power-law distributed, with universal…
Elastic systems, such as magnetic domain walls, density waves, contact lines, and cracks, are all pinned by substrate disorder. When driven, they move via successive jumps called avalanches, with power law distributions of size, duration…
The paper develops one-parametric family of the sand-piles dealing with the grains' local losses on the fixed amount. The family exhibits the crossover between the models with deterministic and stochastic relaxation. The mean height of the…