相关论文: On the Number of Increasing Trees with Label Repet…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…

Arthur Cayley famously proved that there are n to the power n-2 labeled trees on n vertices. Here we go much further and show how to enumerate, fully automatically, labeled trees such that every vertex has a number of neighbors that belongs…

We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

In biology, a phylogenetic tree is a tool to represent the evolutionary relationship between species. Unfortunately, the classical Schr\"oder tree model is not adapted to take into account the chronology between the branching nodes. In…

Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

We estimate the size of a labelled tree by comparing the amount of (labelled) nodes with the size of the set of labels. Roughly speaking, a exponentially big labelled tree, is any labelled tree that has an exponential gap between its size,…

The higher-order Stokes phenomenon can emerge in the asymptotic analysis of many problems governed by singular perturbations. Indeed, over the last two decades, the phenomena has appeared in many physical applications, from acoustic and…

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 consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…

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…