scispace - formally typeset
Search or ask a question

Showing papers on "Random walk closeness centrality published in 2004"


Journal ArticleDOI
TL;DR: The betweenness centrality is proposed as a good indicator for synchronizability and investigated the effects of various factors such as the degree, characteristic path length, heterogeneity, and betweennesscentrality on synchronization to find a consistent trend between the synchronization and the betweennessCentrality.
Abstract: While shorter characteristic path length has in general been believed to enhance synchronizability of a coupled oscillator system on a complex network, the suppressing tendency of the heterogeneity of the degree distribution, even for shorter characteristic path length, has also been reported. To see this, we investigate the effects of various factors such as the degree, characteristic path length, heterogeneity, and betweenness centrality on synchronization, and find a consistent trend between the synchronization and the betweenness centrality. The betweenness centrality is thus proposed as a good indicator for synchronizability.

224 citations


Journal ArticleDOI
TL;DR: It is found that a scale-free tree and shortcuts organize a complex network, and the scale- free spanning tree shows very robust betweenness centrality distributions and the remaining shortcuts characterize the properties of the original network.
Abstract: We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous scale-free networks, it is found that the scale-free spanning tree shows very robust betweenness centrality distributions and the remaining shortcuts characterize the properties of the original network, such as the clustering coefficient and the classification of scale-free networks by the betweenness centrality distribution.

115 citations


Journal ArticleDOI
TL;DR: In this paper, the relationship between betweenness and the cutting number was explored and the results on betweenness centrality and closeness centrality were shown to correct an error in the justification given in his paper.
Abstract: We prove a number of results on betweenness and closeness centrality and centralization. In particular, we prove the much used normalization expression for closeness centrality first given by Freeman (1979), correcting an error in the justification given in his paper. We explore the relationship between betweenness and the cutting number and use these results to prove and correct some centrality and centralization formulae first proposed by Borgatti and Everett (1997).

37 citations


Journal ArticleDOI
TL;DR: This paper aggregates actor indices of centrality across actors to obtain a single group-level index of centralization, and assumes a general blockmodel which allows a rich probabilistic structure of graph centralization.

12 citations