Subleading-order conjecture for cover times of the two-dimensional discrete torus
Statement
Let be the time taken by discrete- or continuous-time random walk to visit every vertex of the two-dimensional discrete torus graph . Subleading-order cover-time conjecture. In probability, as ,
The leading-order law of large numbers was established by Dembo, Peres, Rosen and Zeitouni, while this conjecture concerns the subleading correction and is motivated by the analogous result for two-dimensional Brownian motion.
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.