Network measures - To be discussed

[mitemijalkov]

The following list describes network measures that can be implemented. After discussion of these measures, I will open each one in a separate issue:

• [x] Clustering (double checking) - seems to return NaN in disconnected nodes.
• [ ] Hierarchical organization.
• [x] Rich club.
• [ ] Motifs (Structural and functional)
• [x] Eigenvector centrality.
• [ ] Network hub analysis.
• [x] Network modularity and community structure.
• [ ] Plot and fit degree distribution.

BCT measures:

• [ ] Joint degree
• [ ] Topological overlap
• [ ] Neighborhood overlap
• [ ] Matching index
• [ ] Rentian scaling (to be discussed within a greater topic of whether we would include measures that are present in physically constrained networks).
• [ ] Connected components
• [ ] Overlapping communities (additional algorithms to calculate community structure)
• [ ] Modularity degeneracy and consensus partitioning
• [x] Assortativity
• [x] Core/periphery structure
• [x] K-core and S-core
• [ ] Walks
• [ ] Cycle probability
• [ ] Mean first passage time and Diffusion efficiency
• [ ] Resource efficiency
• [x] Path transitivity
• [ ] Search information
• [ ] Navigation
• [x] Participation and coefficients
• [ ] PageRank centrality
• [ ] Subgraph centrality
• [x] K-coreness centrality
• [ ] Flow coefficient
• [ ] Shortcuts
• [ ] Quasi-idempotence

[giovannivolpe]

ok, let’s open an issue for each of them, if they haven’t already been implemented