English
Related papers

Related papers: The Computational Complexity of Sandpiles

200 papers

The Abelian Sandpile Model (ASM) is a game played on a graph realizing the dynamics implicit in the discrete Laplacian matrix of the graph. The purpose of this primer is to apply the theory of lattice ideals from algebraic geometry to the…

Combinatorics · Mathematics 2012-01-04 David Perkinson , Jacob Perlman , John Wilmes

I report large-scale Monte Carlo studies of a one-dimensional height-restricted stochastic sandpile using the quasistationary simulation method. Results for systems of up to 50 000 sites yield estimates for critical exponents that differ…

Statistical Mechanics · Physics 2007-05-23 Ronald Dickman

We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to…

Quantum Physics · Physics 2009-11-11 Marko Znidaric , Martin Horvat

Emergence is a concept that is easy to exhibit, but very hard to formally handle. This paper is about cubic sand grains moving around on nicely packed columns in one dimension (the physical sandpile is two dimensional, but the support of…

Discrete Mathematics · Computer Science 2013-12-17 Kévin Perrot , Eric Rémila

The scaling properties of waves of topplings in the sandpile model on the Sierpinski gasket are investigated. The exponent describing the asymptotics of the distribution of last waves in an avalanche is found. Predictions for scaling…

Statistical Mechanics · Physics 2007-05-23 F. Daerden , V. B. Priezzhev , C. Vanderzande

We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical region (i.e., where the branching process…

Probability · Mathematics 2015-06-04 Frank Redig , Ellen Saada , Wioletta Ruszel

Adding sand grains at a single site in Abelian sandpile models produces beautiful but complex patterns. We study the effect of sink sites on such patterns. Sinks change the scaling of the diameter of the pattern with the number $N$ of sand…

Statistical Mechanics · Physics 2010-10-01 Tridib Sadhu , Deepak Dhar

This paper is about cubic sand grains moving around on nicely packed columns in one dimension (the physical sand pile is two dimensional, but the support of sand columns is one dimensional). The Kadanoff Sand Pile Model is a discrete…

Discrete Mathematics · Computer Science 2013-01-08 Kévin Perrot , Eric Rémila

The Sand Pile Model (SPM) and its generalization, the Ice Pile Model (IPM), originate from physics and have various applications in the description of the evolution of granular systems. In this article, we deal with the enumeration and the…

Combinatorics · Mathematics 2015-11-19 Wenjie Fang , Roberto Mantaci

A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established…

An Abelian sandpile model is considered on the Husimi lattice of triangles with an arbitrary coordination number q. Exact expressions for the distribution of height probabilities in the Self-Organized Critical state are derived.

Condensed Matter · Physics 2007-05-23 Vl. V. Papoyan , R. R. Shcherbakov

The triggering of avalanches is investigated using discrete element simulations for a process of random extraction of spheres. A monolayer, formed by identical spheres in a hexagonal configuration, is placed on a tilted plane surrounded by…

Soft Condensed Matter · Physics 2023-11-27 Eduardo Rojas , Héctor Alarcón , Vicente Salinas , Gustavo Castillo , Pablo Gutiérrez

A standard model in network synchronised distributed computing is the LOCAL model. In this model, the processors work in rounds and, in the classic setting, they know the number of vertices of the network, $n$. Using $n$, they can compute…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-20 Laurent Feuilloley

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Number Theory · Mathematics 2014-02-26 W. T. Gowers , J. Wolf

We study numerically the spatial properties of relaxation clusters in a two dimensional sandpile automaton with dynamic rules depending stochastically on a parameter p, which models the effects of static friction. In the limiting cases p=1…

Condensed Matter · Physics 2016-08-31 S. Luebeck , K. D. Usadel , B. Tadic

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…

Computational Complexity · Computer Science 2021-08-18 Andrej Bogdanov , Luca Trevisan

This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…

Computational Complexity · Computer Science 2016-04-15 Carlos Barrón-Romero

This paper studies sorted recurrent configurations of the Abelian sandpile model on the complete split graph. We introduce two natural toppling processes, CTI and ITC toppling, on the recurrent configurations and use these to define two…

Combinatorics · Mathematics 2025-12-23 Henri Derycke , Mark Dukes , Yvan Le Borgne

We investigate the problem of ballistically controlled reactions where particles either annihilate upon collision with probability $p$, or undergo an elastic shock with probability $1-p$. Restricting to homogeneous systems, we provide in…

Statistical Mechanics · Physics 2007-05-23 Francois Coppex , Michel Droz , Emmanuel Trizac

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

Computational Geometry · Computer Science 2010-12-14 Pankaj K. Agarwal , Rinat Ben Avraham , Micha Sharir
‹ Prev 1 8 9 10 Next ›