相关论文: Connecting Yule Process, Bisection and Binary Sear…
Phylogenetic trees describe the relationships between species in the evolutionary process, and provide information about the rates of diversification. To understand the mechanisms behind macroevolution, we consider a class of multitype…
This paper studies systems of particles following independent random walks and subject to annihilation, binary branching, coalescence, and deaths. In the case without annihilation, such systems have been studied in our 2005 paper…
Understanding the evolution of binary traits, which affects the birth and survival of species and also the rate of molecular evolution, remains challenging. A typical example is the evolution of mating systems in plant species. In this…
This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…
In this note we describe weight functions that exhibit a transitional behavior between weak and strong correlation with the Liouville function. We also describe a binary problem which may be considered as an interpolation between Chowla's…
We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed…
In this paper a martingale problem for super-Brownian motion with interactive branching is derived. The uniqueness of the solution to the martingale problem is obtained by using the pathwise uniqueness of the solution to a corresponding…
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…
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…
Bipartite learning is a machine learning task that aims to predict interactions between pairs of instances. It has been applied to various domains, including drug-target interactions, RNA-disease associations, and regulatory network…
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal…
In this survey, we explore the connections between two areas of probability: percolation theory and population genetic models. Our first goal is to highlight a construction on Galton-Watson trees, which has been described in two different…
Coalescent models of bifurcating genealogies are used to infer evolutionary parameters from molecular data. However, there are many situations where bifurcating genealogies do not accurately reflect the true underlying ancestral history of…
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for…
In this note we connect the notion of solutions of a martingale problem to the notion of a strongly continuous and locally equi-continuous semigroup on the space of bounded continuous functions equipped with the strict topology. This…
It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.
Universal extensions arise naturally in the Auslander bijections. For an abelian category having Auslander-Reiten duality, we exploit a bijection triangle, which involves the Auslander bijections, universal extensions and the…
Over the last 10 to 15 years, active inference has helped to explain various brain mechanisms from habit formation to dopaminergic discharge and even modelling curiosity. However, the current implementations suffer from an exponential…