Boundary partitions in trees and dimers

From MaRDI portal
Publication:3085128

DOI10.1090/S0002-9947-2010-04964-5zbMATH Open1230.60009arXivmath/0608422OpenAlexW2049198350MaRDI QIDQ3085128FDOQ3085128

David B. Wilson, Richard Kenyon

Publication date: 28 March 2011

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of the different possible node connections in a grove. These probabilities only depend on boundary measurements of the graph and not on the actual graph structure, i.e., the probabilities can be expressed as functions of the pairwise electrical resistances between the nodes, or equivalently, as functions of the Dirichlet-to-Neumann operator (or response matrix) on the nodes. These formulae can be likened to generalizations (for spanning forests) of Cardy's percolation crossing probabilities, and generalize Kirchhoff's formula for the electrical resistance. Remarkably, when appropriately normalized, the connection probabilities are in fact integer-coefficient polynomials in the matrix entries, where the coefficients have a natural algebraic interpretation and can be computed combinatorially. A similar phenomenon holds in the so-called double-dimer model: connection probabilities of boundary nodes are polynomial functions of certain boundary measurements, and as formal polynomials, they are specializations of the grove polynomials. Upon taking scaling limits, we show that the double-dimer connection probabilities coincide with those of the contour lines in the Gaussian free field with certain natural boundary conditions. These results have direct application to connection probabilities for multiple-strand SLE_2, SLE_8, and SLE_4.


Full work available at URL: https://arxiv.org/abs/math/0608422





Cites Work


Cited In (38)






This page was built for publication: Boundary partitions in trees and dimers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085128)