English
Related papers

Related papers: Computational Complexity of Avalanches in the Kada…

200 papers

In this paper we prove that the general avalanche problem AP is in NC, for the Kadanoff sandpile model in one dimension, answering an open problem of Formenti, Goles and Martin in 2010. Thus adding one more item to the (slowly) growing list…

Computational Complexity · Computer Science 2018-03-16 Enrico Formenti , Kévin Perrot , Eric Rémila

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…

Condensed Matter · Physics 2015-06-25 Cristopher Moore , Martin Nilsson

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…

Discrete Mathematics · Computer Science 2013-04-19 Kevin Perrot , Eric Rémila

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…

Discrete Mathematics · Computer Science 2013-02-19 Kevin Perrot , Eric Rémila

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…

Statistical Mechanics · Physics 2011-03-01 N. M. Bogoliubov , A. G. Pronko , J. Timonen

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…

adap-org · Physics 2015-06-24 S. W. Chan , H. F. Chau

We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks whether a cell q will eventually become unstable after adding…

Computational Complexity · Computer Science 2025-06-27 Pablo Concha-Vega , Kévin Perrot

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…

Condensed Matter · Physics 2016-08-31 Agha Afsar Ali , Deepak Dhar

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…

Statistical Mechanics · Physics 2015-05-13 Amir Abdolvand , Afshin Montakhab

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…

Statistical Mechanics · Physics 2016-04-13 Deepak Dhar , Gunnar Pruessner , Paul Expert , Kim Christensen , Nicky Zachariou

We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP…

Computational Complexity · Computer Science 2010-02-22 Andrew Drucker

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…

Statistical Mechanics · Physics 2015-06-24 Volkhard Buchholtz , Thorsten Poeschel

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…

Artificial Intelligence · Computer Science 2012-06-18 Johan Kwisthout , Linda C. van der Gaag

In this paper we introduce new various generalizations of the classical Kadomtsev-Petviashvili hierarchy in the case of operators in several variables. These generalizations are the candidates for systems that should play the role,…

Mathematical Physics · Physics 2007-05-23 Alexander Zheglov

Two-component sandpile models are investigated numerically and theoretically. Monte Calro simulations are performed to show that probability distribution functions of avalanche size and lifetime obey power laws whose exponents are…

Statistical Mechanics · Physics 2007-05-23 Akihiro Fujihara , Toshiya Ohtsuki , Teruhiro Nakagawa

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…

Statistical Mechanics · Physics 2009-10-31 G. C. Barker , Anita Mehta

We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…

Logic in Computer Science · Computer Science 2025-08-26 Eric Alsmann , Martin Lange

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…

Soft Condensed Matter · Physics 2009-10-30 Parthapratim Biswas , Arnab Majumdar , Anita Mehta , J. K. Bhattacharjee

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…

Condensed Matter · Physics 2009-10-30 S. Lubeck , K. D. Usadel

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…

Emerging Technologies · Computer Science 2017-12-05 Aaron T. Becker , Erik D. Demaine , Sándor P. Fekete , Jarrett Lonsforda , Rose Morris-Wright
‹ Prev 1 2 3 10 Next ›