Here is the answer to a bit of an abstract theoretical graph:
Let's simplify the task by just looking at the (directional) dependency graphs between state objects.
The extremely simple answer can be illustrated by considering two limiting cases of dependency graphs:
1st limiting case : cluster graphs .
The cluster graph is the most perfect implementation of the dependency graph with high cohesion and low coupling (taking into account the set of cluster sizes).
The dependence between clusters is maximum (fully connected), and the intercluster dependence is minimal (zero).
This is an abstract illustration of the answer in one of the limiting cases .
The 2nd limiting case is a completely connected graph, where everything depends on everything.
Reality is somewhere in the middle, the closer to the cluster graph, the better, in my humble understanding.
From another point of view : when looking at a directed dependency graph, ideally it should be acyclic, if not, then the cycles form the smallest clusters / components.
One step up / down the hierarchy corresponds to the “one case” of weak connection, close cohesion in software, but this principle of weak connection / close cohesion can be considered as a repeating phenomenon at different depths of an acyclic oriented graph (or one of its spanning tree).
Such a decomposition of the system into a hierarchy helps to overcome exponential complexity (say, in each cluster, there are 10 elements). Then on 6 layers this is already 1 million objects:
10 clusters form 1 supercluster, 10 superclusters form 1 supercluster, etc. .... without the concept of close cohesion, weak connection, such a hierarchical architecture would be impossible.
So this may be the real importance of the story, and not just a low bond with high cohesion in only two layers. The real importance becomes clear when considering abstractions of a higher level and their interaction.