Correlation bounds for fields and matroids

June Huh, Benjamin Schröter, Botong Wang

Let $G$ be a finite connected graph, and let $T$ be a spanning tree of $G$ chosen uniformly at random. The work of Kirchhoff on electrical networks can be used to show that the eve…