From: Inferring network properties based on the epidemic prevalence
N | Network size (the number of nodes) |
E[ D] | Average degree |
E[ D2] | Second moment of degree |
d max | Largest degree |
E[ H] | Average shortest path length (the average hop-count) |
E[ 1/H] | Global efficiency |
λ 1 | Spectral radius (the largest eigenvalue of the adjacency matrix) |
μ N−1 | Algebraic connectivity (the second smallest eigenvalue of the Laplacian matrix) |
ρ D | Assortativity |
C G | Average clustering coefficient |