Abstract: A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges is equal to the sum of the weights of the outgoing edges.