From: Measuring rank robustness in scored protein interaction networks
Name | Details |
---|---|
Degree | Number of neighbours of v |
Local clustering | Proportion of pairs of neighbours of v which are also connected |
Redundancy | (Local clustering) × (Degree - 1) [43] |
PageRank | Calculated with the default damping factor d=0.85 [45] |
Closeness | Reciprocal to the sum over all u of node-to-node distances d(u,v) [46] |
Harmonic centrality | The sum over all u of 1/d(u,v) [47] |
Betweenness | Measures how many shortest paths a node v contributes to [46] |
e_{one}(v) | Number of edges in the step-one ego-network of v |
n_{two}(v) | Number of nodes in the step-two ego-network of v |
n_{diff}(v) | Number of nodes that have exactly distance two to v |
n_{sqdiff}(v) | A measure of relative local density calculated as n_{two}(v)−degree(v)^{2} |
n_{ratio}(v) | The ratio of step-one to step-two neighbourhood sizes for v |
LOUD Average local clustering | f(G) is the average local clustering |
LOUD Global clustering | f(G) is the global clustering, i.e. the proportion of connected triplets of nodes which form triangles |
LOUD Average redundancy | f(G) is the average redundancy |
LOUD Average closeness | f(G) is the average closeness |
LOUD Average path length | f(G) is the average path length |
LOUD Number of connected pairs | f(G) is the number of pairs of nodes, which are in the same connected component |
LOUD Average betweenness | f(G) is the average betweenness |
LOUD Natural connectivity | f(G) is the natural connectivity [44] |
LOUD Average e_{one}(v) | f(G) is the average e_{one}(v) |
LOUD Average n_{two}(v) | f(G) is the average n_{two}(v) |
LOUD Average n_{diff}(v) | f(G) is the average n_{diff}(v) |
LOUD Average n_{sqdiff}(v) | f(G) is the average n_{sqdiff}(v) |
LOUD Average n_{ratio}(v) | f(G) is the average n_{ratio}(v) |