Universal logarithmic-to-linear speed-up conjecture for covering graphs with independent walks
Statement
Let be a graph, let a simple random walk on have cover time , and let denote the expected time for independent walks to cover . Define the speed-up by
Universal speed-up conjecture. There exist universal constants and such that, for every graph and every ,
The conjecture predicts that the speed-up from using independent walks is always at least logarithmic and at most linear in . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.