Eigenvector centrality

In graph theory, eigenvector centrality (also called eigencentrality) is a measure of the influence of a node in a network. It assigns relative… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2017
0204019752017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In an era where accumulating data is easy and storing it inexpensive, feature selection plays a central role in helping to reduce… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
2015
2015
The centrality of vertices has been the key issue in social network analysis. Many centrality measures have been presented, such… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
2015
2015
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We extend the concept of eigenvector centrality to multiplex networks, and introduce several alternative parameters that quantify… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Topological analysis methods have been developed to study the fundamental organizational principles of large-scale metabolic… (More)
  • table I
  • table III
  • table II
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Eigenvectors, and the related centrality measure Bonacich’s c(β), have advantages over graph-theoretic measures like degree… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2007
2007
An efficient data replication service is crucial for improving data accessability and resource utilization as well as providing… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?