The author conducts an extensive correlation coefficient analysis of four prominent centrality measures for mobile ad hoc networks. The centrality measures considered are the degree-based degree centrality and eigenvector centrality, and the shortest path-based betweenness centrality and closeness centrality. The author evaluates the correlation coefficient between any two of the above four cen...

The task of identifying the main key nodes in the dark (covert) networks is very important for the researchers in the field of dark networks analysis. This analysis leads to locate the major nodes in the network as the functionality can be minimized by disrupting major key nodes in the network. In this paper, we have primarily focused on two basic network analysis metrics, degree and betweennes...

Robustness estimation is critical for the design and maintenance of resilient networks, one of the global challenges of the 21st century. Existing studies exploit network metrics to generate attack strategies, which simulate intentional attacks in a network, and compute a metric-induced robustness estimation. While some metrics are easy to compute, e.g. degree centrality, other, more accurate, ...

Group centrality is an extension of the classical notion of centrality for individuals, to make it applicable to sets of them. We perform a SWOT (strengths, weaknesses, opportunities and threats) analysis of the use of group centrality in semantic networks, for different centrality notions: degree, closeness, betweenness, giving prominence to random walks. Among our main results stand out the r...

In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that vertices with large betweenness define what we call characteristic betweenness paths in both modeled and real-world geographical networks. We define a geographical network model that possess a simple topology while still being able to present such betweenne...

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph qualities for any arbitrary number of nodes and edges and analytically derive the form and properties of such networks.

Scale-free networks are a type of complex networks in which the degree distribution of the nodes is according to the power-law. Centrality of the nodes is a quantitative measure of the importance of the nodes according to the topological structure of the network. The commonly used centrality measures are the degree-based degree centrality and eigenvector centrality and the shortest path-based c...

We develop a two-stage experimental protocol by which i) we elicit the social network within a group of undergraduate students and ii) we measure their altruistic attitudes by way of a standard Dictator game. We observe that more socially integrated subjects are also more altruistic, as betweenness centrality and reciprocal degree are positively correlated with the level of giving, even after c...