Given a list of nodes connected among them, the minimum connection network (MCN) can be deduced by using the Dijkstra algorithm [47], which finds shortest the paths among all the nodes.
Signaling pathways are connected among them and such connections can also be detected using the method proposed here.
The structural elements of the model are assigned on distinct layers and connected among them with connectors of dependence and co-occurrence when applying the Assessment Model to software processes.
We observe an interesting modular structure, with several small modules strongly connected among them, and with a tree-like structure.
At the local level, it is shown that nodes in a SW graph are connected to a small number of neighbors (on average) and they tend to be connected among them too (i.e., many triangles are observed).
This aspect can become very critical because, despite base stations are connected among them using a dedicated protocol suite (i.e., through the X2 interface), LTE always requires hard handover, which is, in general, a resource-demanding procedure.
These types of ASes lay in the backbone of the Internet and they are densely connected among them, so that their nodes may not respect the classical notions of community.
In the star architecture, each BS is connected directly to a radio network control (RNC) node, while in the ring architecture all BSs are connected among them and to the RNC by a ring, which operates as a single bus, i.e., any couple of BSs (or BS and RNC) may directly communicate without passing through the RNC.
The following two results about modularity are fundamental to our present work: in [30] Fortunato and Barthélemy showed that modularity has a resolution limit, i.e., its maximization tends to put small communities together when they are connected among them; in [31] Reichardt and Bornholdt observed that modularity can be understood as the Hamiltonian of a ferromagnetic Potts model.
