---
title: "Centrality Algorithms"
description: "Overview of centrality algorithms."
component: "graph-ml"
version: "3.10"
module: "centrality-algorithms"
html_url: "/graph-ml/3.10/centrality-algorithms/"
canonical_url: "https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/"
markdown_url: "https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/index.md"
---

[View as HTML](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/)

# Centrality Algorithms

Centrality algorithms find the important vertices in a graph based on their connections with other vertices. A centrality algorithm usually assigns scores to vertices or edges based on how close they are to the center of connection-based activity. The definition of closeness and what constitutes the center of connection-based activity depend on the algorithm.

The TigerGraph Graph Data Science Library provides the following centrality algorithms:

* [Approximate Closeness Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/approximate-closeness-centrality.md)
* [ArticleRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/article-rank.md)
* [Betweenness Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/betweenness-centrality.md)
* [Closeness Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/closeness-centrality.md)
* [Degree Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/degree-centrality.md)
* [Eigenvector Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/eigenvector-centrality.md)
* [Harmonic Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/harmonic-centrality.md)
* [Influence Maximization](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/influence-maximization.md)
* [PageRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/pagerank.md)
* [Personalized PageRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/personalized-pagerank.md)
* [Weighted Degree Centrality](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/weighted-degree-centrality.md)
* [Weighted PageRank](https://www.tigergraph.com/docs/graph-ml/3.10/centrality-algorithms/weighted-pagerank.md)
