Prefer a chat interface with context about you and your work?
Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances
Let $G$ be a finite graph or an infinite graph on which $\mathbb{Z}^d$ acts with finite fundamental domain. If $G$ is finite, let $\mathbf{T}$ be a random spanning tree chosen uniformly from all spanning trees of $G$; if $G$ is infinite, methods from Pemantle show that this still makes sense, …