Related papers: Abelian Sandpile Model on Randomly Rooted Graphs a…
Due to intermittency and conservation, the Abelian sandpile in 2D obeys multifractal, rather than finite size scaling. In the thermodynamic limit, a vanishingly small fraction of large avalanches dominates the statistics and a constant gap…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
Iterated monodromy groups of postcritically-finite rational maps form a rich class of self-similar groups with interesting properties. There are examples of such groups that have intermediate growth, as well as examples that have…
The sandpile group of a connected graph is a finite abelian group whose cardinality is the number of spanning trees in the graph. We compute the spanning tree number and sandpile group structure for the cone over a bi-coconut tree,…
The abelian sandpile model in two dimensions does not show the type of critical behavior familar from equilibrium systems. Rather, the properties of the stationary state follow from the condition that an avalanche started at a distance r…
I analyse a model of an evolving network represented as a directed graph; each node corresponds to one molecular species and the links to catalytic interactions between species. Over short timescales the graph remains fixed while relative…
We study extreme events in a finite-size 2D Abelian sandpile model, specifically focusing on avalanche area and size. Employing the approach of Block Maxima, the study numerically reveals that the rescaled distributions for the largest…
Avalanche dynamics is an indispensable feature of complex systems. Here we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent $\gamma$ through the Bak-Tang-Wiesenfeld (BTW) sandpile model.…
In the companion paper of this set (Capitan and Cuesta, 2010) we have developed a full analytical treatment of the model of species assembly introduced in Capitan et al. (2009). This model is based on the construction of an assembly graph…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
We introduce a sandpile model where, at each unstable site, all grains are transferred randomly to downstream neighbors. The model is local and conservative, but not Abelian. This does not appear to change the universality class for the…
The well known Sandpile model of self-organized criticality generates avalanches of all length and time scales, without tuning any parameters. In the original models the external drive is randomly selected. Here we investigate a drive which…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
We study the discrete Bak-Sneppen model introduced by Barbay and Kenyon (2001) "On the discrete Bak-Sneppen model of self-organized criticality". We extend their results as well as the non-triviality result of Meester and Znamenskiy (2002)…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
We prove several results concerning a polynomial that arises from the sandpile model on directed graphs; these results are previously only known for undirected graphs. Implicit in the sandpile model is the choice of a sink vertex, and it is…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…