Pfaffian Formulas for Spanning Tree Probabilities

DOI10.1017/S0963548316000183zbMath1376.82021arXiv1407.3748OpenAlexW1552789685MaRDI QIDQ5366937

Greta Panova, David Bruce 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) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (3)

Boundary correlations in planar LERW and UST ⋮ Sandpile probabilities on triangular and hexagonal lattices ⋮ Schramm’s formula for multiple loop-erased random walks

Cites Work

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

This page was built for publication: Pfaffian Formulas for Spanning Tree Probabilities