Table 1.

Centrality measures for monoplex networks. For detailed description of these measures and many others, please refer³²

Centrality measure	Centrality of node i	Description
Eigenvector centrality	$$x_i={\lambda }^{-1}j{A}_{ij}{x}_j$$	λ is the leading eigenvalue
PageRank centrality	$$x_i=\alpha j{A}_{ij}\frac{x_j}{k_j}$$	α is a scalar and kj is the degree of node j
HITS centrality (authority)	$$x_i=\alpha j{A}_{ij}{y}_j$$	α is a scalar and yj is the hub centrality of node j
HITS centrality (hub)	$$y_i=\alpha j{A}_{ij}{x}_j$$	α is a scalar and xj is the authority centrality of node j
Betweenness centrality	$$x_i=st\frac{n_{\text{st}}^i}{g_{\text{st}}}$$	ni st is the # of shortest paths between sandt that go through i. gst is the total # of shortest paths between nodes sand t