FIGURE 2.

Spanning trees and steady-state probabilities. (A) An example graph, G, on five vertices, $\left\{1,\dots ,5\right\}$ , with 11 edges, labeled k ₁,…, k ₁₁. G is strongly connected. (B) The 20 spanning trees of G rooted at vertex 5 (red), each with its corresponding monomial product of edge labels. The sum of these 20 edge label products gives ρ ₅(G) in Eq. 5.