A sequential construction of a random spanning tree for the Cayley graph of a finitely generated, countably infinite subsemigroup V of a group G is considered. At stage n, the spanning tree T isapproximated by a finite tree Tn rooted at the identity.The approximation Tn+1 is obtained by connecting edges to the points of V that are not already vertices of Tn but can be obtained from vertices of Tn via multiplication by a random walk step taking values in the generating set of V. This construction leads to a compactification of the semigroup V inwhich a sequence of elements of V that is not eventually constant is convergent if the random geodesic through the spanning tree T that joins the identity to the nth element of the sequence converges in distribution as n→∞. The compactification is identified in a number of examples. Also, it is shown that if h(Tn) and #(Tn) denote, respectively, the height and size of the approximating tree Tn, then there are constants 0<ch≤1 and 0≥c# ≤log2 such that limn→∞ n–1 h(Tn)= ch and limn→∞n–1 log# (Tn)= c# almost surely.
The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
