1 citations · 1 across the 14 of their papers we have counts for
Showing 2026 · math.PRShow all
2 papers · 2 filters
math.PR2026
Online Permutation Embedding: Optimal Stopping and Scaling Laws
Dylan J. Altschuler, Quentin Dubroff, Konstantin Tikhomirov
We study optimal online algorithms for embedding a permutation of into an iid stream of uniform random variables. This problem is a broad generalization of the cl…
math.PR2026
Faster random walks via infrequent steering
Boris Bukh, Quentin Dubroff
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability that we can…