Related papers: Associative and commutative tree representations f…
Balancing model complexity against the information contained in observed data is the central challenge to learning. In order for complexity-efficient models to exist and be discoverable in high dimensions, we require a computational…
This is a largely expository paper in which we discuss various sets having a Catalan number of objects and some well-known bijections between these sets presented in a new and hopefully interesting way. We call these concepts "bookshelf"…
Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…
The likelihood function represents statistical evidence in the context of data and a probability model. Considerable theory has demonstrated that evidence strength for different parameter values can be interpreted from the ratio of…
The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Ensemble of regression trees have become popular statistical tools for the estimation of conditional mean given a set of predictors. However, quantile regression trees and their ensembles have not yet garnered much attention despite the…
The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Fa\`a di Bruno algebra, and then to the group of a free operad over Schr\"oder trees. This leads to new combinatorial…
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Boolean formulas that we call case-factor diagrams (CFDs). CFDs…
We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…
We find explicit formulas for the probabilities of general boundary visit events for planar loop-erased random walks, as well as connectivity events for branches in the uniform spanning tree. We show that both probabilities, when suitably…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
We construct a tree-based dependence structure for the representation of binomial, Poisson and Gaussian random vectors having a given covariance matrix, using sums of independent random variables. This construction allows us to characterize…
We provide an efficient encoding of the natural numbers {0,1,2,3,...} as strings of nested parentheses {(),(()),(()()),((())),...}, or considered inversely, an efficient enumeration of such strings. The technique is based on the recursive…
The study of sums of possibly associated Bernoulli random variables has been hampered by an asymmetry between positive correlation and negative correlation. The Conway-Maxwell Binomial (COMB) distribution and its multivariate extension, the…
Connection of the Four Color Theorem (FCT) with some operations on trees is described. L.H. Kauffman's theorem about FCT and vector cross product is discussed. Operation of transplantation on trees linked with the move of brackets according…
A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
Existing ordinal trees and random forests typically use scores that are assigned to the ordered categories, which implies that a higher scale level is used. Versions of ordinal trees are proposed that take the scale level seriously and…
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses $x \oplus y$, is satisfiable. We revisit this classical problem by giving an alternative, explicit expression of this probability. We…