* Centralities
- Katz centrality
- solves the problems presented by the eigenvector centrality
- basic idea is to give some "free" centrality to the vertices
- pagerank
- the main idea: a vertex should contribute to its out-neighbours'
centrality less if it has a high degree => divide by the out-degree
- algorithm of choice of search engines like Google