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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Richard W. Kenyon / rank
Normal rank
 
Property / author
 
Property / author: David Bruce Wilson / rank
Normal rank
 

Revision as of 08:55, 13 February 2024

scientific article
Language Label Description Also known as
English
The Green's function on the double cover of the grid and application to the uniform spanning tree trunk
scientific article

    Statements

    The Green's function on the double cover of the grid and application to the uniform spanning tree trunk (English)
    0 references
    15 February 2021
    0 references
    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.
    0 references
    0 references
    loop-erased random walk
    0 references
    Laplacian
    0 references
    Green's function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references