Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1210.4244

Structural properties of Stochastic Abelian Sandpile

Ayush Choure
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 burning test which detects presence of forbidden sub-configurations (FSC) in strongly polynomial time. In the stochastic case, however, even for Manna's model, which is perhaps the simplest non-trivial example, no such procedure is known. In this paper, we address the decision problem of the existence of any FSC in a general stochastic sandpile. We demonstrate a polynomial time algorithm which, given the sandpile graph and toppling rules, decides if there exists an FSC. In the event of a positive answer, it generates at least one FSC for the given sandpile. Repeated application of the algorithm can be used to find many distinct FSCs. We also demonstrate a procedure for creating larger FSCs from smaller ones and use this to create FSCs for the Manna's model. We hope that the structural analysis of stochastic sandpile we perform in this paper, will prove useful in the eventual formulation of a deterministic procedure to decide recurrence.

Explore related subjects

math.COnlin.AO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ayush Choure. 2012-10-16. Structural properties of Stochastic Abelian Sandpile. https://arxiv.org/abs/1210.4244

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗