Related papers: Avalanche polynomials
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work…
Avalanche behavior of gravitationally-forced granular layers on a rough inclined plane are investigated experimentally for different materials and for a variety of grain shapes ranging from spherical beads to highly anisotropic particles…
The periodic wind-tree model is an infinite billiard in the plane with identical rectangular scatterers disposed at each integer point. We prove that independently of the size of the scatterers, generically with respect to the angle, the…
We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.
Topological defects dominate the deformation response of materials in processes ranging from quantum turbulence to crystal plasticity. We calculate the probability distribution function for the fluctuations in velocity $v$, using scaling…
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…
Plastic yield of amorphous solids occurs by power law distributed slip avalanches whose universality is still debated. Determination of the power law exponents from experiments and molecular dynamics simulations is hampered by limited…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
Fiber bundles with statistically distributed thresholds for breakdown of individual fibers are interesting models of the static and dynamics of failures in materials under stress. They can be analyzed to an extent that is not possible for…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
We study slip avalanches in disordered materials under an increasing external load in the framework of a fiber bundle model. Over-stressed fibers of the model do not break, instead they relax in a stick-slip event which may trigger an…
A tree, embedded into plane, is a dessin d'enfant and its Belyi function is a polynomial --- Shabat polynomial. The Zapponi form of this polynomial is unique, so we can correspond to an embedded tree the Julia set of its Shabat-Zapponi…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
Recently, there has been interest in extending long-known results about the multispecies coalescent tree to other models of gene trees. Results about the gene duplication and loss (GDL) tree have mathematical proofs, including species tree…
A pebble tree is an ordered tree where each node receives some colored pebbles, in such a way that each unary node receives at least one pebble, and each subtree has either one more or as many leaves as pebbles of each color. We show that…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
Probability estimation is one of the fundamental tasks in statistics and machine learning. However, standard methods for probability estimation on discrete objects do not handle object structure in a satisfactory manner. In this paper, we…