Combinatorics of tripartite boundary connections for trees and dimers

MaRDI QIDQ2380271zbMATH OpenFDO

Authors Richard Kenyon, David B. Wilson

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0811.1766, https://eudml.org/doc/226988, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r112.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

treegrovePfaffianDirichlet-to-Neumann matrixdouble-dimer model

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: 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.

Recommendations

• Boundary partitions in trees and dimers
• Pfaffian formulas for spanning tree probabilities
• Dimers, tilings and trees
• Combinatorics of the double-dimer model
• Trees and matchings

Cited in

(10)

• Trees of nuclei and bounds on the number of triangulations of the 3-ball
• The space of circular planar electrical networks
• Boundary partitions in trees and dimers
• The planar Ising model and total positivity
• Combinatorics of the double-dimer model
• Combinatorics of the double-dimer model
• Pfaffian formulas for spanning tree probabilities
• Hitting matrix and domino tiling with diagonal impurities
• Symplectic geometry of electrical networks
• Dungeons and dragons: combinatorics for the \(dP_3\) quiver

This page was built for publication: Combinatorics of tripartite boundary connections for trees and dimers

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