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^{∞}_{t=0}μ_{t}(i) / t! where μ_{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^{A})_{ii} where e^{A} is the matrix exponential of A