Related papers: A Cayley-type identity for trees

We introduce equivariant tree models in algebraic statistics, which unify and generalise existing tree models such as the general Markov model, the strand symmetric model, and group based models. We focus on the ideals of such models. We…

We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…

We use the theory of \Gamma-species to enumerate k-gonal and polygonal 2-trees with respect to their vertices. We then extend this result to enumerate "succulents", a tree-like class of graphs which generalize cacti.

For the Ising model on Cayley trees we give a very wide class of new Gibbs measures. We show that these new measures are extreme under some conditions on the temperature. We give a review of all known Gibbs measures of the Ising model on…

Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…

Individual tree species labels are particularly hard to acquire due to the expert knowledge needed and the limitations of photointerpretation. Here, we present a methodology to automatically mine species labels from public forest inventory…

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…

In this paper, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or $k$-sided polygons ($k$-gons), where $k\geq 3$ is fixed. This generalization, to $k$-gonal 2-trees, is natural and is closely related, in the planar…

This note derives asymptotic upper and lower bounds for the number of planted plane trees on $n$ nodes assigned labels from the set $\{1,2,\ldots, k\}$ with the restriction that on any path from the root to a leaf, the labels must strictly…

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e a…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…

We present an algorithm that, on input $n$, lists every unlabeled tree of order $n$.

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…

The spectral statistics of a Cayley-tree is numerically studied. The statistics are non-universal due to the high ratio of boundary sites. Once the boundary sites are connected to each other in a way that preserves the local structure of…

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on $n$ labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial…

We prove that the number of crossings in a random labelled tree with vertices in convex position is asymptotically Gaussian with mean $ n^2/6$ and variance $ n^3/45$. A similar result is proved for points in general position under mild…