Geodesic
Combinatorics of tripartite boundary connections for trees and dimers
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for "tripartite" pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the Dirichlet-to-Neumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pairings. These Pfaffian formulas are used to give exact expressions for reconstruction: reconstructing the conductances of a planar graph from boundary measurements. We prove similar theorems for the double-dimer model on bipartite planar graphs.
DOI : 10.37236/201
Classification : 60C05, 82B20, 05C05, 05C50
Mots-clés : tree, grove, double-dimer model, Dirichlet-to-Neumann matrix, Pfaffian 
@article{10_37236_201,
     author = {Richard W. Kenyon and David B. Wilson},
     title = {Combinatorics of tripartite boundary connections for trees and dimers},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/201},
     zbl = {1225.60020},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/201/}
}
TY  - JOUR
AU  - Richard W. Kenyon
AU  - David B. Wilson
TI  - Combinatorics of tripartite boundary connections for trees and dimers
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/201/
DO  - 10.37236/201
ID  - 10_37236_201
ER  - 
%0 Journal Article
%A Richard W. Kenyon
%A David B. Wilson
%T Combinatorics of tripartite boundary connections for trees and dimers
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/201/
%R 10.37236/201
%F 10_37236_201
Richard W. Kenyon; David B. Wilson. Combinatorics of tripartite boundary connections for trees and dimers. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/201

Cité par Sources :