Spectral centrality measures in complex networks.

  title={Spectral centrality measures in complex networks.},
  author={Nicola Perra and Santo Fortunato},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={78 3 Pt 2},
  • N. Perra, S. Fortunato
  • Published 21 May 2008
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on their topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank (PR), eigenvector centrality (EV), and the hub and authority scores of the HITS… 

Controlling centrality in complex networks

It is shown that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links.

Topological centrality and its e-Science applications

The topological centrality measure reflecting the topological positions of node and edges as well as influence between nodes and edges in general network is proposed.

A measure of centrality based on the spectrum of the Laplacian

  • S. PaulsD. Remondini
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
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.

Centrality measure of complex networks using biased random walks

We propose a novel centrality measure based on the dynamical properties of a biased random walk to provide a general framework for the centrality of vertex and edge in scale-free networks (SFNs). The

Influence measures in subnetworks using vertex centrality

A decomposition of the relative centrality measure is given, by including also the relative influence of the single node with respect to a given subgraph containing it, in both the entire network and the specific sectors to which the assets belong.

Spectral centrality measures in temporal networks

The scope of centrality measures in temporal networks is broadened to centraly measures derived from the eigenvectors of network matrices, namely the Eigenvector in-centrality, theEigenvector out-centraly, the Katz centrality, and the Bonacich a and (a,b)-centrality.

Applying centrality measures to impact analysis: A coauthorship network analysis

It is found that the four centrality measures are significantly correlated with citation counts and it is suggested thatcentrality measures can be useful indicators for impact analysis.

An improved degree measurement index based on the social network

Based on analysis of the classic centrality metric, an improved node centrality metrics (c-index) is proposed, to measure collaboration strength of nodes in a weighted collaboration network.

A change of perspective in network centrality

A new perspective is proposed where centrality definition arises naturally from the most basic feature of a network, its adjacency matrix, and different centrality measures naturally emerge, including degree, eigenvector, and hub-authority centrality.



Subgraph centrality in complex networks.

A new centrality measure that characterizes the participation of each node in all subgraphs in a network, C(S)(i), which is better able to discriminate the nodes of a network than alternate measures such as degree, closeness, betweenness, and eigenvector centralities.

Spectral measures of bipartivity in complex networks.

It is shown that the bipartivity characterizes the network structure and can be related to the efficiency of semantic or communication networks, trophic interactions in food webs, construction principles in metabolic networks, or communities in social networks.

A set of measures of centrality based upon betweenness

A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced, used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.

The Structure and Function of Complex Networks

Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Random Walks on Directed Networks: the Case of PageRank

PageRank, the prestige measure for Web pages used by Google, is the stationary probability of a peculiar random walk on directed graphs, which interpolates between a pure random walk and a process

Epidemic spreading in scale-free networks.

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.