Of Notes
Centrality
Table of Contents
We are gonna say there are four types of centrality:
- Degree - how connected a node is
- Closeness - How close to targets
- Betweenness - Traffic based (flow of information)
- Eigenvector - Connection to important nodes
We define some sort of average distance of a node by saying:
Closeness Centrality
This is the complement of the average distance:
Betweenness Centrality
This is some information about the importance of a node for moving around some graph.
We first define
and
Using these two we then define:
which can be simplified for a tree graph by removing the node
where
Identities
like when they are 1
Eigenvector Centrality
TODO study this in more depth and derive the concept