Related papers: Structural properties of Stochastic Abelian Sandpi…
In the sandpile model, vertices of a graph are allocated grains of sand. At each unit of time, a grain is added to a randomly chosen vertex. If that causes its number of grains to exceed its degree, that vertex is called unstable, and…
The stochastic sandpile model (SSM) is a generalisation of the standard Abelian sandpile model (ASM), in which topplings of unstable vertices are made random. When unstable, a vertex sends one grain to each of its neighbours independently…
We study stochastic sandpile models with a height restriction in one and two dimensions. A site can topple if it has a height of two, as in Manna's model, but, in contrast to previously studied sandpiles, here the height (or number of…
We study the steady state of the abelian sandpile models with stochastic toppling rules. The particle addition operators commute with each other, but in general these operators need not be diagonalizable. We use their abelian algebra to…
We consider the abelian stochastic sandpile model. In this model, a site is deemed unstable when it contains more than one particle. Each unstable site, independently, is toppled at rate $1$, sending two of its particles to neighbouring…
We introduce a natural stochastic extension, called SSP, of the abelian sandpile model(ASM), which shares many mathematical properties with ASM, yet radically differs in its physical behavior, for example in terms of the shape of the steady…
In the rotational sandpile model, either the clockwise or the anti-clockwise toppling rule is assigned to all the lattice sites. It has all the features of a stochastic sandpile model but belongs to a different universality class than the…
This paper presents a new stochastic finite element method for computing structural stochastic responses. The method provides a new expansion of stochastic response and decouples the stochastic response into a combination of a series of…
We study the Abelian sandpile model (ASM), a process where grains of sand are placed on a graph's vertices. When the number of grains on a vertex is at least its degree, one grain is distributed to each neighboring vertex. This model has…
Abelian sandpile models, both deterministic, such as the Bak, Tang, Wiesenfeld (BTW) model [P. Bak, C. Tang and K. Wiesenfeld, Phys. Rev. Lett. {\bf 59}, 381 (1987)], and stochastic, such as the Manna model [S.S. Manna, J. Phys. A {\bf 24},…
Factored stochastic constraint programming (FSCP) is a formalism to represent multi-stage decision making problems under uncertainty. FSCP models support factorized probabilistic models and involve constraints over decision and random…
History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…
The Abelian Sandpile Model, seen as a deterministic lattice automaton, on two-dimensional periodic graphs generates complex regular patterns displaying (fractal) self-similarity. In particular, on a variety of lattices and initial…
We introduce a new model of a stochastic sandpile on a graph $G$ containing a sink. When unstable, a site sends one grain to each of its neighbours independently with probability $p \in (0,1]$. For $p=1$, this coincides with the standard…
The abelian sandpile model is a simple combinatorial model for critical behaviour which has the "abelian property" that the order in which we make moves does not change the final outcome of the game. This might seem to restrict the model's…
Fractionally supervised classification (FSC) offers a flexible framework for combining labeled and unlabeled data in model-based classification, but existing formulations assume simple random sampling. In many applications, however, the…
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This…
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 have studied one-dimensional cellular automata with updating rules depending stochastically on the difference of the heights of neighbouring cells. The probability for toppling depends on a parameter lambda which goes to one with…
In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…