Due to the fact that mutual information is always non-negative, \(I(\Delta \mathbf {V}_k; \Delta \mathbf {V}_i) \ge I(\Delta \mathbf {V}_k; \Delta \mathbf {V}_l)\) . Therefore, the mutual information between connected buses is larger than the mutual information between not connected buses. Then, by using the mutual information as the weight, the maximum weight spanning tree algorithm (Chow-Liu algorithm) solves (REF ) and estimates the distribution grid topology [1]}, [2]}.
