6 citations · 15 across the 4 of their papers we have counts for
6 papers
The Horton-Strahler Number of Conditioned Galton-Watson Trees
Anna M. Brandenberger, Luc Devroye, Tommy Reddad
The Horton-Strahler number of a tree is a measure of its branching complexity; it is also known in the literature as the register function. We show that for critical Galton-Watson…
Discrete minimax estimation with trees
Luc Devroye, Tommy Reddad
We propose a simple recursive data-based partitioning scheme which produces piecewise-constant or piecewise-linear density estimates on intervals, and show how this scheme can dete…
The total variation distance between high-dimensional Gaussians with the same mean
Luc Devroye, Abbas Mehrabian, Tommy Reddad
Given two high-dimensional Gaussians with the same mean, we prove a lower and an upper bound for their total variation distance, which are within a constant factor of one another.
On the discovery of the seed in uniform attachment trees
Luc Devroye, Tommy Reddad
We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's prop…
The Minimax Learning Rates of Normal and Ising Undirected Graphical Models
Luc Devroye, Abbas Mehrabian, Tommy Reddad
Let be an undirected graph with edges and vertices. We show that -dimensional Ising models on can be learned from i.i.d. samples within expected total variat…
Encoding Arguments
Pat Morin, Wolfgang Mulzer, Tommy Reddad
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and sho…