Pfaffian formulas for spanning tree probabilities

DOI10.1017/S0963548316000183MaRDI QIDQ5366937zbMATH OpenOpenAlexFDO

Authors Greta Panova, David B. Wilson

Publication date 10 October 2017

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Pfaffian

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We show that certain topologically defined uniform spanning tree probabilities for graphs embedded in an annulus can be computed as linear combinations of Pfaffians of matrices involving the line-bundle Green's function, where the coefficients count cover-inclusive Dyck tilings of skew Young diagrams.

Recommendations

• Note on the Pfaffian matrix-tree theorem
• scientific article; zbMATH DE number 953290
• The Green's function on the double cover of the grid and application to the uniform spanning tree trunk
• Asymptotic Enumeration of Spanning Trees
• Spanning trees of 3-uniform hypergraphs

Cites work

• Boundary partitions in trees and dimers
• Circular planar graphs and resistor networks
• Combinatorics of tripartite boundary connections for trees and dimers
• Determinants of Laplacians on graphs
• Double-dimer pairings and skew Young diagrams
• Dyck tilings, increasing trees, descents, and inversions
• Generalized Dyck tilings (extended abstract)
• Path representation of maximal parabolic Kazhdan-Lusztig polynomials.
• Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
• Spanning forests and the vector bundle Laplacian
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• The cube recurrence
• The space of circular planar electrical networks

Cited in

(6)

• Boundary correlations in planar LERW and UST
• The Green's function on the double cover of the grid and application to the uniform spanning tree trunk
• Combinatorics of tripartite boundary connections for trees and dimers
• Schramm's formula for multiple loop-erased random walks
• Sandpile probabilities on triangular and hexagonal lattices
• Spanning trees of 3-uniform hypergraphs

This page was built for publication: Pfaffian formulas for spanning tree probabilities

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