Related papers: A Microscopic approach to Souslin-tree constructio…
A pair-copula construction is a decomposition of a multivariate copula into a structured system, called regular vine, of bivariate copulae or pair-copulae. The standard practice is to model these pair-copulae parametrically, which comes at…
A consensus tree is a phylogenetic tree that synthesizes a given collection of phylogenetic trees, all of which share the same leaf labels but may have different topologies, typically obtained through bootstrapping. Our research focuses on…
Structural information of phylogenetic tree topologies plays an important role in phylogenetic inference. However, finding appropriate topological structures for specific phylogenetic inference tasks often requires significant design effort…
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…
We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually…
In computational phylogenetics, the problem of constructing a supertree of a given set of rooted input trees can be formalized in different ways, to cope with contradictory information in the input. We consider the Minimum Flip Supertree…
We study how macroscopic observational constraints restrict admissible microscopic explanatory structures when no intrinsic order or dynamics is assumed a priori. Starting from an unordered collection of measurement outcomes, we formulate…
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…
Random forests construct each tree with a different, randomised representation of the feature space. Their uniform voting cannot correct errors in regions where trees with incorrect representations probabilistically outnumber correct ones,…
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees…
The paper introduces a Poisson-type problem on a mixed-dimensional structure combining a Euclidean domain and a lower-dimensional self-similar component touching a compact surface (interface). The lower-dimensional piece is a so-called…
Multi-material design optimization problems can, after discretization, be solved by the iterative solution of simpler sub-problems which approximate the original problem at an expansion point to first order. In particular, models…
This paper presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm introduced in Lee et al. (2013). In PPF, trees are constructed by splitting on…
We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by straight-line context free tree grammars (which are also…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…
Phylogenetic analysis of DNA or other data commonly gives rise to a collection or sample of inferred evolutionary trees. Principal Components Analysis (PCA) cannot be applied directly to collections of trees since the space of evolutionary…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…
This paper describes techniques for growing classification and regression trees designed to induce visually interpretable trees. This is achieved by penalizing splits that extend the subset of features used in a particular branch of the…