Nice paper sketching an straight forward algorithum to layout a graph informed by the assumption that the graph’s connectivity exhibits a power-law distribution. The general idea is to sort the graph into rank order and then layout the upper-classes first and pack the lower-classes in latter.
I love the way that a even a graph layout problem becomes a statement on strategy, social engineering, governance, etc. when your working on things like this.
“The highest layer possesses a small number of highly influential nodes. Consequently, it requires the highest temperature so that the nodes are forced to spread out from one another, and explore the global search space. This is essential as these highly connected nodes define the final structure of the graph.”