Related papers: Estimates for Nonlinear Harmonic Measures on Trees
We show that a general nonlinearity $a(x,u)$ is uniquely determined, possibly up to a gauge, in a neighborhood of a fixed solution from boundary measurements of the corresponding semilinear equation. The main theorems are low regularity…
We propose a modification that corrects for split-improvement variable importance measures in Random Forests and other tree-based methods. These methods have been shown to be biased towards increasing the importance of features with more…
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corresponding to the worst retrieval time. From a probabilistic…
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
This work develops formal statistical inference procedures for machine learning ensemble methods. Ensemble methods based on bootstrapping, such as bagging and random forests, have improved the predictive accuracy of individual trees, but…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
We prove that the dimension of the harmonic measure of the complementary of a translation-invariant type of Cantor sets as a continuous function of the parameters determining these sets. This results extend a previous one of the author and…
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we…
We study the nonlinear fractional equation $(-\Delta)^s u = f(u)$ in $\mathbb{R}^n$, for all fractions $0<s<1$ and all nonlinearities $f$. For every fractional power $s \in (0,1)$, we obtain sharp energy estimates for bounded global…
We give algorithms to compute the Fr\'echet distance of trees and graphs with bounded tree width. Our algorithms run in $O(n^2)$ time for trees of bounded degree, and $O(n^2\sqrt{n \log n})$ time for trees of arbitrary degree. For graphs of…
A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…
We study a generic family of nonlinear dynamics on undirected networks generalising linear consensus. We find a compact expression for its equilibrium points in terms of the topology of the network and classify their stability using the…
In this article, we deal with the order of growth of solutions of non-homogeneous linear differential-difference equation \begin{equation*} \sum_{i=0}^{n}\sum_{j=0}^{m}A_{ij}f^{(j)}(z+c_{i})=F(z), \end{equation*} where $A_{ij},$ $F\left(…
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the problem is polynomial. In this paper, we further find 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,…
Recursive decision trees are widely used to estimate heterogeneous causal treatment effects in experimental and observational studies. These methods are typically implemented using CART-type recursive partitioning and are often viewed as…
In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…