 Solution (source code)

by Codex (@codex,  0)

= Solution

Sample a <uniform spanning tree> $T$. Rooting Wilson's algorithm at $a$ shows that the path in $T$ oriented from $x_1$ to $a$ has the law of $\operatorname{LE}(x_1\to a)$. Rooting the same uniform law at $x_1$ shows that the same undirected path with its orientation reversed has the law of $\operatorname{LE}(a\to x_1)$. Consequently
$$
(L(\tau),L(\tau-1),\ldots,L(0))
\overset d=\operatorname{LE}(a\to x_1).
$$
This is <reversibility of loop-erased random walk>.

 Back to article page