Quentin Dubroff

activity

20182026

most citedA better bound for ordinary triangles

1 citations · 1 across the 14 of their papers we have counts for

collaborators

Showing math.PRShow all

3 papers · 1 filter

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 $[k]$ into an iid stream of uniform $[0, 1]$ 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 $ε > 0$ that we can…

math.PR2021

Linear cover time is exponentially unlikely

Quentin Dubroff, Jeff Kahn

Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $ε > 0$ such that for any simple graph $G$ on $V$ of size $n$ , and $X_{0}, \dots$ an ordinary rand…