Session Ready
Exercise

Degree, closeness & betweenness

We will examine the well-known Kite network introduced by Krackhardt in 1988. The name stems from the fact that the network structure resembles a kite. Let’s now calculate some of the centrality measures, such as degree, closeness and betweenness, that we discussed before. The kite-network kite and the igraph library are already loaded in your workspace.

Instructions 1/3
undefined XP
  • 1
    • Compute the degree of each node with function degree().
    • Find the node with maximum degree using which.max().
    • 2
      • Compute the closeness of each node with function closeness().
      • Find the node with maximum closeness.
    • 3
      • Compute the betweenness of each node with function betweenness().
      • Find the node with maximum betweenness.
    Loading