相关论文: The probabilities of trees and cladograms under Fo…

We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…

Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard…

Coloured probability tree models are statistical models coding conditional independence between events depicted in a tree graph. They are more general than the very important class of context-specific Bayesian networks. In this paper, we…

We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive…

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.

We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…

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…

We provide an $\Omega(n\log n) $ lower bound and an $O(n^2)$ upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted binary trees with $n$ leaves, i.e., contain all of them…

Associated to an abelian variety over a number field are several interesting and related groups: the motivic Galois group, the Mumford-Tate group, $\ell$-adic monodromy groups, and the Sato-Tate group. Assuming the Mumford-Tate conjecture,…

We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

In this article we present an example of a random oriented tree model on d-dimensional lattice, that is a forest in d=3 with positive probability. This is in contrast with the other random tree models in the literature which are a forest…

For a pair consisting of a gene tree and a species tree, the ancestral configurations at an internal node of the species tree are the distinct sets of gene lineages that can be present at that node. Ancestral configurations appear in…

We find a formula to compute the number of the generators, which generate the $n$-filtered space of Hopf algebra of rooted trees, i.e. the number of equivalent classes of rooted trees with weight $n$. Applying Hopf algebra of rooted trees,…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

We classify the four dimensional perfect non-simple evolution algebras over a field having characteristic different from 2 and in which there are roots of orders 2, 3 and 7.

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…