Combinatorics of Tripartite Boundary Connections for Trees and Dimers

Details Combinatorics of Tripartite Boundary Connections for Trees and Dimers Combinatorics of Tripartite Boundary Connections for Trees and Dimers

2008-11-11

arxiv.org/abs/0811.1766v1

Electronic Journal of Combinatorics 16(1):R112, 2009

Mathematics

Combinatorics

29 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combinatorics of Tripartite Boundary Connections for Trees and Dimers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorics of Tripartite Boundary Connections for Trees and Dimers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorics of Tripartite Boundary Connections for Trees and Dimers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100113