Related papers: Avalanche polynomials
We study the phenomenon of internal avalanching within the context of recently introduced lattice models of granular media. The avalanche is produced by pulling out a grain at the base of the packing and studying how many grains have to…
We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…
We review the Majumdar-Dhar bijection between recurrent states of the Abelian sandpile model and spanning trees. We generalize earlier results of Athreya and Jarai on the infinite volume limit of the stationary distribution of the sandpile…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
Poly-trees are singly connected causal networks in which variables may arise from multiple causes. This paper develops a method of recovering ply-trees from empirically measured probability distributions of pairs of variables. The method…
Elastic systems, such as magnetic domain walls, density waves, contact lines, and cracks, are all pinned by substrate disorder. When driven, they move via successive jumps called avalanches, with power law distributions of size, duration…
The height probabilities for the recurrent configurations in the Abelian Sandpile Model on the square lattice have analytic expressions, in terms of multidimensional quadratures. At first, these quantities have been evaluated numerically…
In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
In this paper, we provide a polynomial time algorithm to calculate the probability of a {\it ranked} gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The…
This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
We consider the problem of PAC-learning decision trees, i.e., learning a decision tree over the n-dimensional hypercube from independent random labeled examples. Despite significant effort, no polynomial-time algorithm is known for learning…
We study the patterns formed by adding $N$ sand-grains at a single site on an initial periodic background in the Abelian sandpile models, and relaxing the configuration. When the heights at all sites in the initial background are low…
We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a…
Avalanches whose sizes and durations are distributed as power laws appear in many contexts. Here, we show that there is a hidden peril in thresholding continuous times series --either from empirical or synthetic data-- for the detection of…
We introduce a notion of finite sampling consistency for phylogenetic trees and show that the set of finitely sampling consistent and exchangeable distributions on n leaf phylogenetic trees is a polytope. We use this polytope to show that…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…