Centrality measure is an important concept in networks. It indicates the relative importance of nodes in a network. Various centrality measures have been proposed in the literature, such as degree centrality, closeness centrality etc. Practically all these measures are some values based on the properties of the node concerned. Eigenvector centrality takes into account the centrality value of th...

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...

The importance of a node in social network is identified through set measures called centrality. Degree centrality, closeness betweenness centrality and clustering coefficient are the most frequently used metrics to compute Their computational complexity some cases makes unfeasible, when not practically impossible, their computations. For this reason we focused on two alternative measures, WERW...

Distance and centrality computations are important building blocks for modern graph databases as well as for dedicated graph analytics systems. Two commonly used centrality metrics are the compute-intense closeness and betweenness centralities, which require numerous expensive shortest distance calculations. We propose batched algorithm execution to run multiple distance and centrality computat...

Control of genetic regulatory networks is challenging to define and quantify. Previous control centrality metrics, which aim to capture the ability of individual nodes to control the system, have been found to suffer from plausibility and applicability problems. Here we present a new approach to control centrality based on network convergence behaviour, implemented as an extension of our geneti...

Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ. We make use of this trend of monotonic ...

In opportunistic networks, the use of social metrics (e.g., degree, closeness and betweenness centrality) of human mobility network, has recently been shown to be an effective solution to improve the performance of opportunistic forwarding algorithms. Most of the current social-based forwarding schemes exploit some globally defined node centrality, resulting in a bias towards the most popular n...

"Kurtosis" has long been considered an appropriate measure to quantify the extent of fat-tailedness of the degree distribution of a complex real-world network. However, the Kurtosis values for more than one realworld network have not been studied in conjunction with other statistical measures that also capture the extent of variation in node degree. Also, the Kurtosis values of the distribution...