Related papers: A New Construction of Forests with Low Visibility

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…

Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measure over R^d representing a distribution of queries. We…

Robust density estimation refers to the consistent estimation of the density function even when the data is contaminated by outliers. We find that existing forest density estimation at a certain point is inherently resistant to the outliers…

We consider the one-dimensional generalized forest fire process: at each site of $\zz$, seeds and matches fall according some i.i.d. stationary renewal processes. When a seed falls on an empty site, a tree grows immediately. When a match…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

The Poisson structures for 3D systems possessing one constant of motion can always be constructed from the solution of a linear PDE. When two constants of the motion are available the problem reduces to a quadrature and the structure…

For a fixed set $X$, an arbitrary \textit{weight structure} $d \in [0,\infty]^{X \times X}$ can be interpreted as a distance assignment between pairs of points on $X$. Restrictions (i.e. \textit{metric axioms}) on the behaviour of any such…

Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…

Let $\eta_t$ be a Poisson point process with intensity measure $t\mu$, $t>0$, over a Borel space $\mathbb{X}$, where $\mu$ is a fixed measure. Another point process $\xi_t$ on the real line is constructed by applying a symmetric function…

A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…

It is shown that a locally finite ultrametric space $(X, d)$ is generated by labeled tree if and only if, for every open ball $B \subseteq X$, there is a point $c \in B$ such that $d(x, c) = \operatorname{diam} B$ whenever $x \in B$ and $x…

Dynamic mean field theory is applied to the problem of forest fires. The starting point is the Monte Carlo simulation in a lattice of million cells. The statistics of the clusters is obtained by means of the Hoshen--Kopelman algorithm. We…

The two-dimensional directed spanning forest (DSF) introduced by Baccelli and Bordenave is a planar directed forest whose vertex set is given by a homogeneous Poisson point process $\mathcal{N}$ on $\mathbb{R}^2$. If the DSF has direction…

We construct a N-dimensional Gaussian landscape with multiscale, translation invariant, logarithmic correlations and investigate the statistical mechanics of a single particle in this environment. In the limit of high dimension N>>1 the…

We develop here a simple quantisation formalism that make use of Lie algebra properties of the Poisson bracket. When the brackets $\{H,\phi_i\}$ and $\{\phi_i,\phi_j\}$, where $H$ is the Hamiltonian and $\phi_i$ are primary and secondary…

Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical…

We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we…

We prove an analogue for homogeneous trees and certain affine buildings of a result of Bourgain on pinned distances in sets of positive density in Euclidean spaces. Furthermore, we construct an example of a non-homogeneous tree with…

Dealing with datasets of very high dimension is a major challenge in machine learning. In this paper, we consider the problem of feature selection in applications where the memory is not large enough to contain all features. In this…