Fig. 1: Illustration of the Cluster Level Optimised Vertex Embedding (CLOVE) algorithm. | Communications Physics

Fig. 1: Illustration of the Cluster Level Optimised Vertex Embedding (CLOVE) algorithm.

From: CLOVE, a Travelling Salesman’s approach to hyperbolic embeddings of complex networks with communities

Fig. 1

a A network with the detected communities indicated by the different colours. b The weighted network between the communities. c Optimal arrangement of the communities on the native disk according to the solution of the Travelling Salesman Problem (TSP) on the weighted network in (b). d Zooming into one of the modules with the two neighbouring communities also shown. e Sub-modules in the previous community and their optimal arrangement based on the TSP, taking into account also the neighbours from the top-level. f Optimal arrangement of the sub-modules at the second level based on the local TSPs. g Shows the network embedded into the native disk.

Back to article page