Search arXivSearch

arXiv · 1906.02802

Some statistics about Tropical Sandpile Model

Abstract

Tropical sandpile model (or linearized sandpile model) is the only known continuous geometric model exhibiting self-organised criticality. This model represents the scaling limit behavior of a small perturbation of the maximal stable sandpile state on a big subset of $\mathbb Z^2$. Given a set $P$ of points in a compact convex domain $Ω\subset \mathbb R^2$ this linearized model produces a tropical polynomial $G_P{\bf 0}_Ω$. Here we present some quantitative statistical characteristics of this model and some speculative explanations. Namely, we study the dependence between the number $n$ of randomly dropped points $P=\{p_1,\dots,p_n\}\subset[0,1]^2=Ω$ and the degree of the tropical polynomial $G_{P}{\bf 0}_Ω$. We also study the distributions of the coefficients of $G_{P}{\bf 0}_Ω$ and the correlation between them. This paper's main (experimental) result is that the tropical curve $C(G_{P}{\bf 0}_Ω)$ defined by $G_{P}{\bf 0}_Ω$ is a small perturbation of the standard square grid lines. This explains a previously known fact that most of the edges of the tropical curve $C(G_{P}{\bf 0}_Ω)$ are of directions $(1,0),(0,1),(1,1),(-1,1)$. The main theoretical result is that $C(G_{P}{\bf 0}_Ω)\setminus (P\cap \partialΩ)$, i.e. the tropical curve in $Ω^\circ$ with marked points $P$ removed, is a tree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Kalinin, Yulieth Prieto. 2023-06-13. Some statistics about Tropical Sandpile Model. https://doi.org/10.46298/cm.10500

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO