ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CNC_N be the time taken by discrete- or continuous-time random walk to visit every vertex of the two-dimensional discrete torus graph (Z/NZ)2(\mathbb{Z}/N\mathbb{Z})^2. Subleading-order cover-time conjecture. In probability, as N→∞N\to\infty,

CN2πN2log⁡N=log⁡N2−(1+o(1))log⁡log⁡N.\frac{C_N}{\frac{2}{\pi}N^2\log N}=\log N^2-\big(1+o(1)\big)\log\log N.

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