Related papers: Forests whose matching powers are linear

Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one color class. We show that the problem is…

Decision trees are widely used for interpretable machine learning due to their clearly structured reasoning process. However, this structure belies a challenge we refer to as predictive equivalence: a given tree's decision boundary can be…

The weighted shifts are long known and important class of operators. One of known generalisation of this class are weighted shifts on directed trees, where we replace the linear order of coordinates in $\ell^2$ with a possibly more…

Leaf powers and pairwise compatibility graphs were introduced over twenty years ago as simplified graph models for phylogenetic trees. Despite significant research, several properties of these graph classes remain poorly understood. In this…

Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…

We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…

A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over…

In this paper, we proposed a hierarchical quadratic random forest classifier for classifying multiresolution samples extracted from multichannel data. This forest incorporated a penalized multivariate linear discriminant in each of its…

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…

A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central…

Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance annotated trees. While usual weight-balanced trees perform…

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

This paper focuses on unsupervised modeling of morphological families, collectively comprising a forest over the language vocabulary. This formulation enables us to capture edgewise properties reflecting single-step morphological…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

In this paper we study classes of monomial ideals for which all of its powers have a linear resolution. Let K[x_{1},x_{2}] be the polynomial ring in two variables over the field K, and let L be the generalized mixed product ideal induced by…

We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.

The paper attempts to validate the effectiveness of tree classifiers to classify tabla strokes especially the ones which are overlapping in nature. It uses decision tree, ID3 and random forest as classifiers. A custom made data sets of 650…