Related papers: The Abelian Sandpile Model on Fractal Graphs
In 2008 Amanatidis, Green and Mihail introduced the Joint Degree Matrix (JDM) model to capture the fundamental difference in assortativity of networks in nature studied by the physical and life sciences and social networks studied in the…
Consider the Abelian sandpile measure on $\mathbb{Z}^d$, $d \ge 2$, obtained as the $L \to \infty$ limit of the stationary distribution of the sandpile on $[-L,L]^d \cap \mathbb{Z}^d$. When adding a grain of sand at the origin, some region,…
For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…
In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…
This contribution is a review of the deep and powerful connection between the large scale properties of critical systems and their description in terms of a field theory. Although largely applicable to many other models, the details of this…
Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed to converge to a legitimate state.Those algorithms are not…
The aim of this note is to systematize our knowledge about identical configurations of ASM.
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
We investigate the bulldozing motion of a granular sandpile driven forwards by a vertical plate. The problem is set up in the laboratory by emplacing the pile on a table rotating underneath a stationary plate; the continual circulation of…
We study the abelian sandpile model in two dimensions on a directed cylindrical lattice with periodic transverse boundary conditions in the transverse direction and dissipation at one boundary. Recurrent configurations form a finite abelian…
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},…
We study universality classes and crossover behaviors in non-Abelian directed sandpile models, in terms of the metastable pattern analysis. The non-Abelian property induces spatially correlated metastable patterns, characterized by the…
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…
Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of Self-Organized Criticality. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain…
An Abelian sandpile model is considered on the Husimi lattice of square plaquettes. Exact expressions for the distribution of height probabilities in the Self-Organized Critical state are derived. The two-point correlation function for the…
The divisible sandpile model is a fixed-energy continuous counterpart of the Abelian sandpile model. We start with a random initial configuration and redistribute mass deterministically. Under certain conditions the sandpile will stabilize.…
We present some combinatorial results on the stochastic abelian sandpile model. These models are characterized by nondeterministic toppling rules. The recurrence checking for the deterministic case can be performed using the well known…
The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for…
Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of…
We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The…