Table 2 The topology properties of networks.

From: Multi-source detection based on neighborhood entropy in social networks

DataSet

|V|

|E|

\(<d>\)

\(<k>\)

\(\varsigma\)

Karate

34

78

2.41

4.60

0.570

Dolphin

62

159

3.36

5.13

0.259

Celegans

453

2025

2.66

8.94

0.646

Facebook

4039

88,234

3.69

43.69

0.606

Git

37,700

289,003

3.25

15.33

0.168

Gowalla

196,591

950,327

4.627

9.668

0.237

  1. |V| and |E| denote the number of nodes and edges in the network, respectively. \(<d>\) denotes the average length of all shortest paths. \(<k>\) denotes the network average. \(\varsigma\) denotes the average clustering coefficient of the network.
Back to article page