The Green's function on the double cover of the grid and application to the uniform spanning tree trunk (Q2227468): Difference between revisions

In this present paper, the authors investigate the Green's function and a closely related operator, the inverse Kasteleyn matrix, on the double cover of \(\mathbb{Z}^{2}\) branched over a face or a vertex. The authors define the Green's function as a limit of the Green's function \(G_n\) on the graphs \(\mathcal{G}_n=\mathbb{Z}^{2}\cap[-n,n]\times [-n,n]\) with Dirichlet boundary conditions. An exact expression for the Green's functions for the double branched covers of \(\mathbb{Z}^{2}\) is computed. The authors show that the spanning tree edge probabilities near the two-ended loop-erased random walk on \(\mathbb{Z}^{2}\) form a determinantal process. Then, the authors study the Kasteleyn matrix on regions with a hole (a monomer) at the origin, and how this relates to the uniform spanning tree trunk measure. They compute the inverse Kasteleyn matrix using the Green's function on the double cover of the square lattice \(\mathbb{Z}^{2}\). They illustrate with an example calculation. In the spanning tree trunk measure for the square lattice, the authors prove that the probability that the trunk contains the path \((1, 0)(3, 0)\cdots (2k +1, 0)\) is \((\sqrt{2}-1)^k\). In the last section, similar calculations for the triangular lattice are obtained.