Topic
Katz centrality
About: Katz centrality is a research topic. Over the lifetime, 601 publications have been published within this topic receiving 77858 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A centrality measure, with a practical application in urban network, has been proposed, which establishes a ranking of nodes focused on the topological data distribution and a visual comparison of the results produced by the various measures calculated from the algorithms studied.
29 citations
•
TL;DR: This survey discusses the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, method to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on.
Abstract: In complex networks, each node has some unique characteristics that define the importance of the node based on the given application-specific context. These characteristics can be identified using various centrality metrics defined in the literature. Some of these centrality measures can be computed using local information of the node, such as degree centrality and semi-local centrality measure. Others use global information of the network like closeness centrality, betweenness centrality, eigenvector centrality, Katz centrality, PageRank, and so on. In this survey, we discuss these centrality measures and the state of the art literature that includes the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, methods to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on. The paper is concluded with a discussion on application specific centrality measures that will help to choose a centrality measure based on the network type and application requirements.
29 citations
••
TL;DR: This work proposes the framework BADIOS that manipulates the graph by compressing it and splitting into pieces so that the centrality computation can be handled independently for each piece.
Abstract: The betweenness and closeness metrics are widely used metrics in many network analysis applications. Yet, they are expensive to compute. For that reason, making the betweenness and closeness centrality computations faster is an important and well-studied problem. In this work, we propose the framework BADIOS that manipulates the graph by compressing it and splitting into pieces so that the centrality computation can be handled independently for each piece. Experimental results show that the proposed techniques can be a great arsenal to reduce the centrality computation time for various types and sizes of networks. In particular, it reduces the betweenness centrality computation time of a 4.6 million edges graph from more than 5 days to less than 16 hours. For the same graph, the closeness computation time is decreased from more than 3 days to 6 hours (12.7x speedup).
28 citations
••
TL;DR: A semi-local centrality index is proposed to incorporate the shortest distance, the number of shortest paths and the reciprocal of average degree simultaneously, and it is verified that the proposed centrality can outperform well-known centralities, such as degree centrality, betweenness centrality
Abstract: The problem of identifying influential nodes in complex networks has attracted much attention owing to its wide applications, including how to maximize the information diffusion, boost product promotion in a viral marketing campaign, prevent a large scale epidemic and so on. From spreading viewpoint, the probability of one node propagating its information to one other node is closely related to the shortest distance between them, the number of shortest paths and the transmission rate. However, it is difficult to obtain the values of transmission rates for different cases, to overcome such a difficulty, we use the reciprocal of average degree to approximate the transmission rate. Then a semi-local centrality index is proposed to incorporate the shortest distance, the number of shortest paths and the reciprocal of average degree simultaneously. By implementing simulations in real networks as well as synthetic networks, we verify that our proposed centrality can outperform well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, k-shell centrality, and nonbacktracking centrality. In particular, our findings indicate that the performance of our method is the most significant when the transmission rate nears to the epidemic threshold, which is the most meaningful region for the identification of influential nodes.
28 citations
••
TL;DR: The ways the software ORA (developed by CASOS at Carnegie Mellon University) handles the most important network measures in case of weighted, asymmetric, self-looped, and disconnected networks are described and discussed.
Abstract: : When Linton C. Freeman made his conceptual clarifications about centrality measures in social network analysis in 1979 he exclusively focused on unweighted, symmetric, and connected networks without the possibility of self-loops. Even though a lot of articles have been published in the last years discussing network measures for weighted, asymmetric or unconnected networks, the vast majority of researchers dealing with social network data simplify their networks based on Freeman's 1979 definitions before they calculate centrality measures. When dealing with weighted and/or asymmetric networks which can have self links and consist of multiple components, researchers are confronted with a lack of standardization. Different tools for social network analysis treat specific cases differently. In this article we describe and discuss the ways the software ORA (developed by CASOS at Carnegie Mellon University) handles the most important network measures in case of weighted, asymmetric, self-looped, and disconnected networks. In the center of our attention are the following measures, degree centrality, closeness centrality, betweenness centrality, eigenvector centrality, and clustering coefficient.
28 citations