Quentin Dubroff

activity

20242026

collaborators

6 papers

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.CO2026

Thresholds vs. expectation thresholds for non-spanning graphs

Quentin Dubroff

The threshold $p_{c} (H)$ for the event that the binomial random graph $G_{n, p}$ contains a copy of a graph $H$ is the unique $p$ for which $P (H \subseteq G_{n, p}) = 1/2$ , an…

math.CO2025

On Minimum Cost Rainbow Structures

Patrick Bennett, Quentin Dubroff, Alan Frieze +1

We discuss the expected minimum cost of rainbow spanning trees and Hamilton cycles in randomly edge colored random graphs.

math.CO2025

On the "second" Kahn--Kalai Conjecture: cliques, cycles, and trees

Quentin Dubroff, Jeff Kahn, Jinyoung Park

We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hope…

math.CO2025

On the "second" Kahn--Kalai Conjecture

Quentin Dubroff, Jeff Kahn, Jinyoung Park

We make progress on a conjecture of Kahn and Kalai, the original (stronger but less general) version of what became known as the ``Kahn-Kalai Conjecture" (KKC; now a theorem of Par…

math.CO2024

Note on a conjecture of Talagrand: expectation thresholds vs. fractional expectation thresholds

Quentin Dubroff, Jeff Kahn, Jinyoung Park

We show that a restricted version of a conjecture of M. Talagrand on the relation between "expectation thresholds" and "fractional expectation thresholds" follows easily from a str…