Linear overhead conjecture for greedy random walk on complete graphs
Statement
Let be the complete graph on vertices, and let denote the edge cover time of greedy random walk. The expected edge cover time is conjectured to satisfy
Linear overhead conjecture.
Thus the overhead beyond traversing all edges is conjectured to be linear in the number of vertices. The paper explains that the available argument gives an bound, whereas linear growth of the relevant bad sets would yield an overhead; the conjecture is presented as a stronger expected bound for the complete graph.
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.