Requirements:
- python3
- igraph https://igraph.org/c/doc/igraph-Flows.html
- numpy
- scipy
- sympy
- networkx
Executing the experiments additionally requires networkx, and the generation of the example figures employs matplotlib.
4.1 Characteristics for ranking elements
- Vertex load
- Betweenness (Already in igraph)
- Random-walk betweenness
- Criticality, graph needs a 'weight' attribute on nodes or edges as appropriate
- Entropy rank
- Free energy rank
- Bridgeness
- Covering degree
- Covering index
- Sensitivity, graph needs a 'weight' attribute on edges
5.1 Component-based characteristics
- Normalized GCC
- Splitting number
- Random-robustness index
- Robustness measure
- Connectivity robustness function
- k-resilience factor
- Resilience factor
- Perturbation score
- Preferential perturbation
- Maximun perturbation score
- Robustness index
- Robustness measure R
5.2 Path-based characteristic
- Local connectivity
- Global connectivity
- Pairwise disconnectivity index
- Fragmentation
- Self-sufficiency
- k vertex-failure resilience
- Vertex resilience
- k edge-failure resilience
- Egde resilience
- Path diversity
- Percolated path, graph needs attribute 'state' on nodes
- Percolation centrality, graph needs attribute 'state' on nodes
- Percentage of noncritical nodes
- Treeness
5.3 Degree-based characteristics
- Degree entropy
- Relative entropy
5.4 Density-based characteristics
- Hub density
- No name, definition523
5.5 Distance-based characteristics
- Geographical diversity
- Effective geographical path diversity
- Total graph geographical diversity
- Compensated total graph geographical diversity
- Functionality
- Functionality loss
- Global functionality loss
- Temporal efficiency
- Delta efficiency
- Fragility
- Dynamic robustness
- Vulnerability
5.6 Random-walk based characteristics
- Network criticality, graph needs attribute 'weight' on edges
5.7 Flow-based characteristics
- Electrical nodal robustness, graphs needs a 'flow' attribute on edges
- Relative area index, return None when a value is not valid
5.8 Spectral characteristics
- Reconstructability coefficient
- Normalized subgraph centrality
- Generalized robustness index
- Local neutral connectivity
- Closed-walk number
- Redundancy of alternative paths
- Neutral connectivity
- Subgraph centrality
- Normalized local natural connectivity
5.9 Other characteristics
- Entropy
- Effective graph resistence, graph needs 'weight' attribute on edges
- Viral conductance
- RCB