Related papers: Fast Simulation of Size-Constrained Multitype Bien…
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…
Machine learned models often must abide by certain requirements (e.g., fairness or legal). This has spurred interested in developing approaches that can provably verify whether a model satisfies certain properties. This paper introduces a…
We investigate some aspects of the problem of the estimation of birth distributions (BD) in multi-type Galton-Watson trees (MGW) with unobserved types. More precisely, we consider two-type MGW called spinal-structured trees. This kind of…
In large domains, Monte-Carlo tree search (MCTS) is required to estimate the values of the states as efficiently and accurately as possible. However, the standard update rule in backpropagation assumes a stationary distribution for the…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…
Without access to large compute clusters, building random forests on large datasets is still a challenging problem. This is, in particular, the case if fully-grown trees are desired. We propose a simple yet effective framework that allows…
We discuss estimation and inference of conditional treatment effects in regression discontinuity (RD) designs with multiple scores. In addition to local linear regressions and the minimax-optimal estimator more recently proposed by Imbens…
In this article, we prove a joint large deviation principle in $n$ for the \emph{empirical pair measure} and \emph{ empirical offspring measure} of critical multitype Galton-Watson trees conditioned to have exactly $n$ vertices in the weak…
Random forests are some of the most widely used machine learning models today, especially in domains that necessitate interpretability. We present an algorithm that accelerates the training of random forests and other popular tree-based…
The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
A particular continuous-time multitype branching process is considered, it is the continuous-time embedding of a discrete-time process which is very popular in theoretical computer science: the m-ary search tree (m is an integer). There is…
Multivariate linear mixed models (mvLMMs) have been widely used in many areas of genetics, and have attracted considerable recent interest in genome-wide association studies (GWASs). However, fitting mvLMMs is computationally non-trivial,…
Cheek and Johnston (Journal of Mathematical Biology, 2023) consider a continuous-time Bienaym\'e-Galton-Watson tree conditioned on being alive at time $T$. They study the reproduction events along the ancestral lineage of an individual…
We introduce an exact distributed algorithm to train Random Forest models as well as other decision forest models without relying on approximating best split search. We explain the proposed algorithm and compare it to related approaches for…
Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…
We present a new class of multifractal process on R, constructed using an embedded branching process. The construction makes use of known results on multitype branching random walks, and along the way constructs cascade measures on the…
We consider here multitype Bienaym\'e--Galton--Watson trees, under the conditioning that the numbers of vertices of given type satisfy some linear relations. We prove that, under some smoothness conditions on the offspring distribution…