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
••
18 Aug 2014TL;DR: This paper proposes the first measure of node centrality that takes into account the community structure of the underlying network, and proposes a generalization of the Owen value—a well-known solution concept from cooperative game theory to study games with a priori-given unions of players.
Abstract: There is currently much interest in the problem of measuring the centrality of nodes in networks/graphs; such measures have a range of applications, from social network analysis, to chemistry and biology. In this paper we propose the first measure of node centrality that takes into account the community structure of the underlying network. Our measure builds upon the recent literature on game-theoretic centralities, where solution concepts from cooperative game theory are used to reason about importance of nodes in the network. To allow for flexible modelling of community structures, we propose a generalization of the Owen value—a well-known solution concept from cooperative game theory to study games with a priori-given unions of players. As a result we obtain the first measure of centrality that accounts for both the value of an individual node's relationships within the network and the quality of the community this node belongs to.
19 citations
•
TL;DR: In this paper, a principled generalization of network centrality measures that is valid for any eigenvector-based centrality measure is introduced, and the concepts of marginal and conditional centrality are introduced to facilitate the study of centrality trajectories over time.
Abstract: Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NTxNT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes' centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court.
19 citations
••
TL;DR: This paper presents a principled way of computing eigenvector-like centrality scores when some dyads are not included in the calculations.
19 citations
01 Jan 2016
TL;DR: This work develops a new game-theoretic solution concept, which is called the Configuration semivalue, and uses the new concept as a building block to construct the first extension of Closeness centrality to networks with community structure (overlapping or otherwise).
Abstract: Certain real-life networks have a community structure in which communities overlap. For example, a typical bus network includes bus stops (nodes), which belong to one or more bus lines (communities) that often overlap. Clearly, it is important to take this information into account when measuring the centrality of a bus stop—how important it is to the functioning of the network. For example, if a certain stop becomes inaccessible, the impact will depend in part on the bus lines that visit it. However, existing centrality measures do not take such information into account. Our aim is to bridge this gap. We begin by developing a new game-theoretic solution concept, which we call the Configuration semivalue, in order to have greater flexibility in modelling the community structure compared to previous solution concepts from cooperative game theory. We then use the new concept as a building block to construct the first extension of Closeness centrality to networks with community structure (overlapping or otherwise). Despite the computational complexity inherited from the Configuration semivalue, we show that the corresponding extension of Closeness centrality can be computed in polynomial time. We empirically evaluate this measure and our algorithm that computes it by analysing the Warsaw public transportation network.
19 citations
••
TL;DR: The k-spectral centralities provide a novel and useful measurement of relevance (for single network elements as well as whole subnetworks) distinct from other known measures.
Abstract: We introduce a family of new centralities, the $k$-spectral centralities. $k$-spectral centrality is a measurement of importance with respect to the deformation of the graph Laplacian associated with the graph. Due to this connection, $k$-spectral centralities have various interpretations in terms of spectrally determined information. We explore this centrality in the context of several examples. While for sparse unweighted networks 1-spectral centrality behaves similarly to other standard centralities, for dense weighted networks they show different properties. In summary, the $k$-spectral centralities provide a novel and useful measurement of relevance (for single network elements as well as whole subnetworks) distinct from other known measures.
19 citations