Get startedGet started for free

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.

This exercise is part of the course

Fraud Detection in R

View Course

Hands-on interactive exercise

Have a go at this exercise by completing this sample code.

# Plot network kite
plot(kite)

# Find the degree of each node
___

# Which node has the largest degree?
___

# Plot kite with vertex.size proportional to the degree of each node
plot(kite, vertex.size = 6 * degree(kite))
Edit and Run Code