Related papers: A deterministic sandpile automaton revisited
As a mathematical model of self-assembling systems, Winfree's abstract Tile Assembly Model (aTAM) is a remarkable platform for studying the behaviors and powers of self-assembling systems. Capable of Turing universal computation, the aTAM…
We develop a weighted Bayesian Bootstrap (WBB) for machine learning and statistics. WBB provides uncertainty quantification by sampling from a high dimensional posterior distribution. WBB is computationally fast and scalable using only…
We employ the eigen microstate approach to explore the self-organized criticality (SOC) in two celebrated sandpile models, namely, the BTW model and the Manna model. In both models, phase transitions from the absorbing-state to the critical…
Bak, Tang, and Wiesenfeld developed their theory of self-organized criticality in the late 1980s to explain why many real-life processes exhibit signs of critical behavior despite the absence of a tuning parameter. A decade later, Dickman,…
Domain wall theory (DWT) has proved to be a powerful tool for the analysis of one-dimensional transport processes. A simple version of it was found very accurate for the Totally Asymmetric Simple Exclusion Process (TASEP) with random…
The current literature on sandpile models mainly deals with the abelian sandpile model (ASM) and its variants. We treat a less known - but equally interesting - model, namely Zhang's sandpile. This model differs in two aspects from the ASM.…
We study sandpile models as closed systems, with conserved energy density $\zeta$ playing the role of an external parameter. The critical energy density, $\zeta_c$, marks a nonequilibrium phase transition between active and absorbing…
We give a non-trivial upper bound for the critical density when stabilizing i.i.d. distributed sandpiles on the lattice $\mathbb{Z}^2$. We also determine the asymptotic spectral gap, asymptotic mixing time and prove a cutoff phenomenon for…
The mechanism of self-organized criticality is based on a steady slow loading and a quick huge stress-release. We add the clustering of the events in space and time to the Bak-Tang-Wiesenfeld cellular automaton and obtain the truncated…
Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…
Since their introduction in the 80s, sandpile models have raised interest for their simple definition and their surprising dynamical properties. In this survey we focus on the computational complexity of the prediction problem, namely, the…
We study a directed stochastic sandpile model of Self-Organized Criticality, which exhibits recurrent, multiple topplings, putting it in a separate universality class from the exactly solved model of Dhar and Ramaswamy. We show that in the…
We have determined families of two-dimensional deterministic totalistic cellular automaton rules whose stationary density of active sites exhibits a period two in time. Each family of deterministic rules is characterized by an ``average…
We consider the BTW model in random link lattices with finite range interaction (RLFRI). The degree distribution for nodes is considered to be uniform in the interval $(0,n_0)$. We numerically calculate the exponents of the distribution…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
The BTW sandpile model is considered on three dimensional percolation lattice which is tunned with the occupation parameter $p$. Along with the three-dimensional avalanches, we study the energy propagation in two-dimensional cross-sections.…
Network infrastructures are essential for the distribution of resources such as electricity and water. Typical strategies to assess their resilience focus on the impact of a sequence of random or targeted failures of network nodes or links.…
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set…
The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…