Subgraph Centrality

- Accounts for the participation of a node in all subgraphs of the network
- Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs (1)
- Measures density of eigenvalues within the network’s adjacency matrix
*A* -
*SC(i) = SUM*where μ^{∞}_{t=0}μ_{t}(i) / t!_{t}(i) is the number of paths starting and ending with node*i*of length*t*and can be calculated by*μ*_{t}(i) = (**A**^{k})_{ii} - This boils down to
*SC(i) = (e*where^{A})_{ii}*e*is the matrix exponential of^{A}**A**

For more Information: