ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let a simple random walk on GG have cover time tcovt_{\mathrm{cov}}, and let tcov(k)t_{\mathrm{cov}}(k) denote the expected time for kk independent walks to cover GG. Define the speed-up by

Sk(G)=tcovtcov(k).S^k(G)=\frac{t_{\mathrm{cov}}}{t_{\mathrm{cov}}(k)}.

Universal speed-up conjecture. There exist universal constants CC and C′C' such that, for every graph GG and every kk,

C′log⁡k≤Sk(G)≤Ck.C'\log k\leq S^k(G)\leq Ck.

The conjecture predicts that the speed-up from using kk independent walks is always at least logarithmic and at most linear in kk. The source attributes it to Alon, Kozma and collaborators; its resolution is not specified in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.