1 2 3 4

16
17 5 6

10
7 8 9

15 14 12
18 11 13

1. Description

Transport network consists of:

Node: city, region, country, port, airport, station (1, 2, 3 …)

Link: connection between nodes (7 – 18, 8 – 11, … )

Two nodes (i and j ) are connected if there is at least one path from i to j.

2. Network indicators:

𝑛 – the number of nodes

𝑑 , = 𝑑 , : distance between i and j (1 ≤ 𝑖, 𝑗 ≤ 𝑛; 𝑖 ≠ 𝑗). Assume that length of any link is 1, so distance between i
and j equals to the number of links between them. 𝑑 , = 1; 𝑑 , = 2; 𝑑 , = 3

𝑟 : radius of i, the longest distance from i to other nodes. 𝑟 = 6

𝑟 = 𝑚𝑎𝑥(𝑑 , ) 1 ≤ 𝑗 ≤ 𝑛; 𝑖 ≠ 𝑗

node i is the centre of the network, if 𝑟 ≤ 𝑟 1 ≤ 𝑗 ≤ 𝑛

𝑑𝑒𝑔 : degree centrality of node i (1 ≤ 𝑖 ≤ 𝑛), the number of nodes connected directly with i. 𝑑𝑒𝑔 = 3; 𝑑𝑒𝑔 = 4

𝑐 : closeness centrality of node i (1 ≤ 𝑖 ≤ 𝑛), average distance of node i to all other nodes
∑ ,
𝑐 = 𝑖≠𝑗

𝑏 : betweeness centrality of node i (1 ≤ 𝑖 ≤ 𝑛) – the number of paths (connecting two other nodes) passing
through node i, the path connecting 11 and 14 consists of node 8 and 9.

𝑏 = 16, all 16 paths from other nodes to node 18 must go through node 7.
Task 1:

Calculate degree centrality of each node

Node Degree centrality Node Degree centrality

1 1 10
2 11
3 12
4 13
5 14
6 15
7 16
8 3 17
9 18

Task 2

Calculate distance between nodes

to 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
From
1 X
2 x
3 X
4 X
5 X
6 X
7 X
8 X
9 X
10 X
11 X
12 X
13 X
14 X
15 X
16 X
17 X
18 X
Task 3

Calculate radius of each node and define centre of the network

Node Radius Node Radius

1 6 10
2 11
3 12
4 13
5 14
6 15
7 16
8 17
9 18

Task 4

Calculate closeness centrality of each node

Node Closeness centrality Node Closeness centrality

1 0 10
2 11
3 12
4 13
5 14
6 15
7 16
8 3 17
9 18

Task 5: Calculate betweeness centrality of each node

To 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
From
1 X 2,4 2,5
2 x 5
3 X
4 2,4 X
5 X
6 X
7 2,5 X
8 X
9 X
10 X
11 X
12 X
13 X
14 X
15 X
16 X
17 X
18 X