Related papers: The Betti numbers of forests
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…
Bipartite determinantal ideals are introduced by Illian and the author as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory and combinatorics.…
Let $\Delta$ be a simplicial complex of a matroid $M$. In this paper, we explicitly compute the regularity of all the symbolic powers of a Stanley-Reisner ideal $I_\Delta$ in terms of combinatorial data of the matroid $M$. In order to do…
We parametrize the affine space of Artinian affine ideals of K[x,y] which have a given initial ideal with respect to the degree reverse lexicographic term order. The fact that the term order is degree compatible allows us to extend the…
We propose and study a multi-scale approach to vector quantization. We develop an algorithm, dubbed reconstruction trees, inspired by decision trees. Here the objective is parsimonious reconstruction of unsupervised data, rather than…
We apply the methods of algebraic reliability to the study of percolation on trees. To a complete $k$-ary tree $T_{k,n}$ of depth $n$ we assign a monomial ideal $I_{k,n}$ on $\sum_{i=1}^n k^i$ variables and $k^n$ minimal monomial…
In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…
Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include online data and data heterogeneity.…
For a Weyl group $W$ of classical type, we present a formula to calculate the restriction of (graded) Springer representations of $W$ to a maximal parabolic subgroup $W'$ where the types of $W$ and $W'$ are in the same series. As a result,…
Inspired by the interval decomposition of persistence modules and the extended Newick format of phylogenetic networks, we show that, inside the larger category of \textit{ordered Reeb graphs}, every Reeb graph with $n$ leaves and first…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and…
Let B_{2t} be a bipartite planar graph with an even number of regions. We are able to find bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to the graph. We also will investigate the minimal…
We propose an algorithm named best-scored random forest for binary classification problems. The terminology "best-scored" means to select the one with the best empirical performance out of a certain number of purely random tree candidates…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
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…
We propose generalized random forests, a method for non-parametric statistical estimation based on random forests (Breiman, 2001) that can be used to fit any quantity of interest identified as the solution to a set of local moment…
Let $I$ be a perfect ideal of height 3 in a Gorenstein local ring $R$. Let $\mathbb{F}$ be the minimal free resolution of $I$. A sequence of linear maps, which generalize the multiplicative structure of $\mathbb{F}$, can be defined using…
The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.
The need for interpreting machine learning models is addressed through prototype explanations within the context of tree ensembles. An algorithm named Adaptive Prototype Explanations of Tree Ensembles (A-PETE) is proposed to automatise the…