Graph Data Science

eigenvector centrality

A centralityHow important a node is within a graph. Each centrality algorithm defines importance differently. algorithm that scores a nodeA vertex in a graph. In a property graph it can carry labels and properties. by the importance of the nodes pointing at it, so a connection to an important node counts for more than one to an unimportant one.

Lessons that use this term

The lesson and course links below open in a new tab.

3 lessons use this term. Results are ordered by term density.

Understand centrality algorithms6 mentions

  • EndorsementUnderstand centrality algorithmsCentrality, PageRank, Article Rank and HITs are the four algorithms in this4 mentions
  • Explore the graphUnderstand centrality algorithmsPage Rank Article Rank Eigenvector Centrality -1 mention
  • What is centrality?Understand centrality algorithmsGraph Data Science library provides Page Rank, Article Rank, Eigenvector Centrality and HITS as members of this1 mention

All glossary terms