Related papers: Differences between the potential theories on a tr…

We prove that the size of the largest common subtree between two uniform, independent, leaf-labelled random binary trees of size $n$ is typically less than $n^{1/2-\varepsilon}$ for some $\varepsilon>0$. Our proof relies on the coupling…

We consider a model of directed polymers on a regular tree with a disorder given by independent, identically distributed weights attached to the vertices. For suitable weight distributions this model undergoes a phase transition with…

This paper presents a detailed comparison of a recently proposed algorithm for optimizing decision trees, tree alternating optimization (TAO), with other popular, established algorithms. We compare their performance on a number of…

The free energy functional has recently been proposed as a variational principle for bounded rational decision-making, since it instantiates a natural trade-off between utility gains and information processing costs that can be…

This paper studies two classes of variational problems introduced in [7], related to the optimal shapes of tree roots and branches. Given a measure $\mu$ describing the distribution of leaves, a sunlight functional $\S(\mu)$ computes the…

In this paper, we focus on the prediction phase of a random forest and study the problem of representing a bag of decision trees using a smaller bag of decision trees, where we only consider binary decision problems on the binary domain and…

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for…

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

The reconstruction of a species tree from genomic data faces a double hurdle. First, the (gene) tree describing the evolution of each gene may differ from the species tree, for instance, due to incomplete lineage sorting. Second, the…

The energy of a molecular graph is a popular parameter that is defined as the sum of the absolute values of a graph's eigenvalues. It is well known that the energy is related to the matching polynomial and thus also to the Hosoya index via…

This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results…

The theorem like Pontryagin's maximum principle for multiple integrals is proved. Unlike the usual maximum principle, the maximum should be taken not over all matrices, but only on matrices of rank one. Examples are given.

Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…

Loss tomography has received considerable attention in recent years and a number of estimators based on maximum likelihood (ML) or Bayesian principles have been proposed. Almost all of the estimators are devoted to the tree topology despite…

The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph $G$ has maximum average degree $\text{mad}(G) = 2 \max_{H \subseteq G} \frac{e(G)}{v(G)}$ at most $2(k + \frac{d}{k+d+1})$, then it has a…

We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of…

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…

Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…

Tree amplitudes of any gauge theory and gravity can be factorized into primitive three-particle amplitudes by the BCFW recursion relations. We show that the amplitudes at any perturbation order are given by tree amplitudes with additional…

We review the calculation of the the effective potential with particular emphasis on cases when the tree potential or the renormalisation-group-improved, radiatively corrected potential exhibits non-convex behaviour. We illustrate this in a…