1 problem

0 votes0 replies1 view
Subleading-order conjecture for cover times of the two-dimensional discrete torus
Let $C_N$ be the time taken by discrete- or continuous-time random walk to visit every vertex of the two-dimensional discrete torus graph $(\mathbb{Z}/N\mathbb{Z})^2$ . Subleading-o…
Conjecturesolvedcover-times random-walks two-dimensional-torusarXiv posted 2 days ago

Subleading-order conjecture for cover times of the two-dimensional discrete torus