Notes

A summmary proof that the uniform spanning tree on a graph is a determinantal process, with the explicit derivation of the kernel. The proof presented is originally due to Benjamini-Lyons-Peres-Schramm