Related papers: The Avalanche Polynomial of a Graph
We study the abelian sandpile model on decorated one dimensional chains. We determine the structure and the asymptotic form of distribution of avalanche-sizes in these models, and show that these differ qualitatively from the behavior on a…
The flood polynomial of a simple finite graph is a weight generating function that counts all flooding cascade sets of the graph. The flood polynomial is inspired by the water mechanics in the video game Minecraft. We give necessary…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
Multiple avalanches, initiated by simultaneously toppling neighbouring sites, are studied in three different directed sandpile models. It is argued that, while the single avalanche exponents are different for the three models, a suitably…
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…
In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
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…
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical region (i.e., where the branching process…
We introduce a simple model for the size distribution of avalanches based on the idea that the front of an avalanche can be described by a directed random walk. The model captures some of the qualitative features of earthquakes, avalanches…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
We investigate the avalanche dynamics of the abelian sandpile model on arbitrarily large balls of the expanded cactus graph (the Cayley graph of the free product $\mathbb{Z}_3 * \mathbb{Z}_2$). We follow the approach of Dhar and Majumdar…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
The partial Petrial polynomial was first introduced by Gross, Mansour, and Tucker as a generating function that enumerates the Euler genera of all possible partial Petrials on a ribbon graph. Yan and Li later extended this polynomial…
The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…
In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph $G$ - and showed it has several attractive properties. First, it is…
Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including…
We numerically study avalanches in the two dimensional Abelian sandpile model in terms of a sequence of waves of toppling events. Priezzhev et al [PRL 76, 2093 (1996)] have recently proposed exact results for the critical exponents in this…