Related papers: Projections of the Aldous chain on binary trees: I…
We give a novel combinatorial interpretation to the perturbative series solutions for a class of Dyson-Schwinger equations. We show how binary tubings of rooted trees with labels from an alphabet on the tubes, and where the labels satisfy…
By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit…
We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study the distribution of…
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either well-structured regular subgraphs or those with many triangles. We observe a superdiffusion for the highly connected nodes while it is…
The Yule branching process is a classical model for the random generation of gene tree topologies in population genetics. It generates binary ranked trees -- also called "histories" -- with a finite number $n$ of leaves. We study the…
The last decade brought a significant increase in the amount of data and a variety of new inference methods for reconstructing the detailed evolutionary history of various cancers. This brings the need of designing efficient procedures for…
We consider the following, intuitively described process: at time zero, all sites of a binary tree are at rest. Each site becomes activated at a random uniform [0,1] time, independent of the other sites. As soon as a site is in an infinite…
Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
Linear model trees are regression trees that incorporate linear models in the leaf nodes. This preserves the intuitive interpretation of decision trees and at the same time enables them to better capture linear relationships, which is hard…
A staged tree model is a discrete statistical model encoding relationships between events. These models are realised by directed trees with coloured vertices. In algebro-geometric terms, the model consists of points inside a toric variety.…
We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…
We show that a randomly perturbed digraph, where we start with a dense digraph $D_\alpha$ and add a small number of random edges to it, will typically contain a fixed orientation of a bounded degree spanning tree. This answers a question…
In Aldous and Shields (1988), a model for a rooted, growing random binary tree was presented. For some c>0, an external vertex splits at rate c^(-i) (and becomes internal) if its distance from the root (depth) is i. For c>1, we reanalyse…
We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…
Work introduces a hierarchical binary tree-based reduction that replaces standard self-attention. The core idea is to use a recursive Gated Linear Unit merge operation, achieving O(n) total merge operations O(log n) parallel depth O(n d^2)…
Classifier chains are an effective technique for modeling label dependencies in multi-label classification. However, the method requires a fixed, static order of the labels. While in theory, any order is sufficient, in practice, this order…
In this paper we demonstrate connections between three seemingly unrelated concepts. (1) The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, $ {\mathcal T}_{\infty}$: The $n$-th edge…
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…