A combinatorial proof of a formula of Biane and Chapuy

Sinho Chewi, Venkat Anantharam

Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the direc…