Related papers: Avalanche polynomials
We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…
We characterize the distributions of size and duration of avalanches propagating in complex networks. By an avalanche we mean the sequence of events initiated by the externally stimulated `excitation' of a network node, which may, with some…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of…
The integrand of any multi-loop integral is characterised after Feynman parametrisation by two polynomials. In this review we summarise the properties of these polynomials. Topics covered in this article include among others: Spanning trees…
Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge and star graphs are characterized by its alliance polynomial.…
We establish the large deviation probabilities for the height of random recursive trees, revealing polynomial upper-tail decay and stretched-exponential lower-tail decay. Remarkably, the lower tail features an atypical prefactor that grows…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…
We analyze the statistics of water droplet avalanches in a continuously driven system. Distributions are obtained for avalanche size, lifetime, and time between successive avalanches, along with power spectra and return maps. For low flow…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
It is a common belief that power-law distributed avalanches are inherently unpredictable. This idea affects phenomena as diverse as evolution, earthquakes, superconducting vortices, stock markets, etc; from atomic to social scales. It…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an input graph has a spanning even tree. Hofmann and Walsh…
We review limiting models for fracture in bundles of fibers, with statistically distributed thresholds for breakdown of individual fibers. During the breakdown process, avalanches consisting of simultaneous rupture of several fibers occur,…
For a poset whose Hasse diagram is a rooted plane forest $F$, we consider the corresponding tree descent polynomial $A_F(q)$, which is a generating function of the number of descents of the labelings of $F$. When the forest is a path,…
We study the statistics of height and balanced height in the binary search tree problem in computer science. The search tree problem is first mapped to a fragmentation problem which is then further mapped to a modified directed polymer…
We introduce a new quantity, average fitness, into the Bak-Sneppen evolution model. Through the new quantity, a different hierarchy of avalanches is observed. The gap equation, in terms of the average fitness, is presented to describe the…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
A two-dimensional directed stochastic sandpile model is studied analytically with the use of directed Abelian algebras recently introduced by Alcaraz and V. Rittenberg [Phys. Rev. E {\bf 78}, 041126 (2008)]. Exact expressions for the…