made by onur

This site is open source. View on GitHub

ESM Network Analysis — Centrality Measures

3 tasks · 6 pts max · no time limit

← Back

Scenario

Project Team Knowledge Network

A five-member project team shares the following undirected expertise-sharing ties:

A–B, A–C, A–D, B–C, D–E

where A = Alice, B = Bob, C = Carol, D = Dave, E = Eve.

Formulas:

Normalised degree centrality: DC(v)=deg⁡(v)/(n−1)DC(v) = \deg(v) / (n-1)DC(v)=deg(v)/(n−1)

Network density: density=∣E∣/(n2)\text{density} = |E| / \binom{n}{2}density=∣E∣/(2n​)

Normalised betweenness centrality:

BC(v)=∑s≠v≠tσst(v)/σst(n−1)(n−2)/2BC(v) = \frac{\displaystyle\sum_{s \neq v \neq t} \sigma_{st}(v) / \sigma_{st}}{(n-1)(n-2)/2}BC(v)=(n−1)(n−2)/2s=v=t∑​σst​(v)/σst​​

where σst\sigma_{st}σst​ = total number of shortest paths from sss to ttt, and σst(v)\sigma_{st}(v)σst​(v) = those that pass through vvv.

Task 1: What is Alice's normalised degree centrality DC(A) in this five-person network?

Choose one

Or enter your answer (±2% tolerance)

Task 2: What is the network density — the proportion of all possible ties that are present?

Choose one

Or enter your answer (±2% tolerance)

Task 3: What is Alice's normalised betweenness centrality BC(A)?

Choose one

Or enter your answer (±2% tolerance)