Identification of Influential Nodes via Effective Distance-based Centrality Mechanism in Complex Networks

Table 4

Comparison of a toy network’s ranking results of EDBC with other various algorithms, where GR, PL, and PR represent profit leader, page rank, and gravity, respectively. Here, EDBC^∗ and SIR^∗ indicate the ranking value of the EDBC and SIR value, respectively.

BC	CC	EC	H-index	HITS	K-shell	PR	PL	GR	EDB	EDBC^∗	SIR	SIR^∗
16	16	16	9	16	16	16	16	16	16	57.63	16	1.93
9	9	12	12	12	12	7	7	9	7	45.78	7	1.62
7	7	14	13	14	13	9	9	7	9	37.38	9	1.60
8	12	9	14	9	14	8	8	12	12	27.24	8	1.41
12	5	13	16	13	9	13	14	13	8	26.37	14	1.49
13	8	8	6	8	6	12	13	14	14	25.17	13	1.44
14	13	6	7	15	7	14	12	8	13	24.65	12	1.51
1	14	15	8	6	8	5	15	6	6	18.96	15	1.31
2	6	7	15	7	15	6	6	15	15	18.96	6	1.32
3	15	10	5	10	5	15	5	5	5	17.83	5	1.34
4	10	5	11	5	11	1	11	10	10	15.89	11	1.13
5	1	11	2	11	2	2	4	2	1	10.70	4	1.17
6	2	1	3	1	3	3	1	3	2	10.70	1	1.15
15	3	2	4	2	4	4	2	4	3	10.70	2	1.16
11	4	3	1	3	1	11	3	11	4	10.70	3	1.15
10	11	4	10	4	10	10	10	1	11	06.69	10	1.17