7 papers
Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
Zhenyuan Zhang
We prove tight asymptotics of the cover time of a continuous-time branching random walk on the Hamming graph , as . We focus…
Stabilizing the Splits through Minimax Decision Trees
Zhenyuan Zhang, Hengrui Luo
By revisiting the end-cut preference (ECP) phenomenon associated with a single CART (Breiman et al. (1984)), we introduce MinimaxSplit decision trees, a robust alternative to CART…
Tightness Analysis of First Passage Times of -Dimensional Branching Random Walk
Jose Blanchet, Zhenyuan Zhang
Given a discrete-time non-lattice supercritical branching random walk in , we investigate its first passage time to a shifted unit ball of a distance from the ori…
Viral Quasispecies Evolution as a Branching Random Walk on the Hypercube
Jose Blanchet, Zhenyuan Zhang
We study a continuous-time nearest-neighbor branching random walk on the -dimensional -ary hypercube as a model for viral quasispecies evolution under m…
On the First Passage Times of Branching Random Walks in
Jose Blanchet, Wei Cai, Shaswat Mohanty +1
We study the first passage times of discrete-time branching random walks in where . Here, the genealogy of the particles follows a supercritical Galton-Wat…
Empirical martingale projections via the adapted Wasserstein distance
Jose Blanchet, Johannes Wiesel, Erica Zhang +1
Given a collection of multidimensional pairs , we study the problem of projecting the associated suitably smoothed empirical measure onto the space of…