Figure 1. .
Edge strength normalization to maintain connectivity differences between a strongly connected and a weakly connected node. (A) A weighted graph with five nodes and six edges. (B) Adding self loops to nodes with weaker connections in order to normalize the probabilities. (C) Transition probabilities from nodes a and b after normalization (the transition probabilities from nodes c, d, and e are not included in this figure).