Network Centrality Solutions in SGL

After summarizing the investigated use of networks in many areas of human activity in the previous chapters and briefing the developed Spatial Grasp Technology and its Spatial Grasp Language (SGL), the chapter investigates, evaluates, and models one of the most important features of graphs and networks called Centrality, with its variants Degree Centrality, Closeness Centrality, Betweenness Centrality, and Eigen Vector Centrality. Detailed, efficient, and extremely compact SGL scenarios for solving these centrality problems on a chosen network topology are provided and discussed, being also integral, highly parallel, and fully distributed. They can operate on arbitrary complex and large network structures and evolve in time and space without any central resources.