相关论文: Abelian Sandpile Model on Randomly Rooted Graphs a…

Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for…

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

We consider a stochastic variant of the Abelian Sandpile Model (ASM) on a finite graph, introduced by Chan, Marckert and Selig. Even though it is a more general model, some nice properties still hold. We show that on a certain probability…

The paper contributes to building algebraic foundations of self-organized criticality answering a previously unsolved question about the limiting structure of the extended sandpile group as well as relating it to another limit at the level…

The Abelian Manna model of self-organized criticality is studied on various three-dimensional and fractal lattices. The exponents for avalanche size, duration and area distribution of the model are obtained by using a high-accuracy moment…

Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this…

Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…

We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of…

A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a finite group $\mathbb{Z}^{n-1}/\mathbb{Z}^{n-1}M$ known as the sandpile (or critical) group $S(\Gamma)$ of $\Gamma$. We determine $S(\Gamma)$ of…

We review the Majumdar-Dhar bijection between recurrent states of the Abelian sandpile model and spanning trees. We generalize earlier results of Athreya and Jarai on the infinite volume limit of the stationary distribution of the sandpile…

We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erd\H{o}s-R\'enyi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

The critical group of an abelian network is a finite abelian group that governs the behavior of the network on large inputs. It generalizes the sandpile group of a graph. We show that the critical group of an irreducible abelian network…

We prove that Abelian sandpiles with random initial states converge almost surely to unique scaling limits. The proof follows the Armstrong-Smart program for stochastic homogenization of uniformly elliptic equations. Using simple random…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…

Kinetic equations, which explicitly take into account the branching nature of sandpile avalanches, are derived. The dynamics of the sandpile model is described by the generating functions of a branching process. Having used the results…

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…

We introduce a natural Boltzmann measure over polyominoes induced by boundary avalanches in the Abelian Sandpile Model. Through the study of a suitable associated process, we give an argument suggesting that the probability distribution of…

The avalanche polynomial on a graph captures the distribution of avalanches in the abelian sandpile model. Studied on trees, this polynomial could be defined by simply considering the size of the subtrees of the original tree. In this…