Mathematical definition of network topological measure for (un)directed graphs
Measure . | Definition for Undirected Graph . | Definition for Directed Graph . |
---|---|---|
(Out)-degree (ki) | ∑j∈Naij | ∑j∈Naij |
In-degree () | / | ∑j∈Naji |
Shortest path length (dij) | ∑ auv, auv ∈ gi↔j | ∑ auv, auv ∈ gi→j |
Number of triangles (ti) | ∑j,haijaihajh | ∑j,h (aij + aji)(aih + ahi)(ajh + ahj) |
Global efficiency (E) | ∑i∈NEi = ∑i∈N | |
Local efficiency (Eloc) | ∑i∈N | ∑i∈N |
Clustering coefficient (C) | ∑i∈N | ∑i∈N |
Transitivity (T) | ||
Modularity (Q) | ∑u∈M [euu − (∑v∈Meuv)]2 |
Measure . | Definition for Undirected Graph . | Definition for Directed Graph . |
---|---|---|
(Out)-degree (ki) | ∑j∈Naij | ∑j∈Naij |
In-degree () | / | ∑j∈Naji |
Shortest path length (dij) | ∑ auv, auv ∈ gi↔j | ∑ auv, auv ∈ gi→j |
Number of triangles (ti) | ∑j,haijaihajh | ∑j,h (aij + aji)(aih + ahi)(ajh + ahj) |
Global efficiency (E) | ∑i∈NEi = ∑i∈N | |
Local efficiency (Eloc) | ∑i∈N | ∑i∈N |
Clustering coefficient (C) | ∑i∈N | ∑i∈N |
Transitivity (T) | ||
Modularity (Q) | ∑u∈M [euu − (∑v∈Meuv)]2 |