Graph Density
Measure edge saturation
Graph density is the ratio of actual edges to possible edges - how "full" is your graph?
What It Computes
Density = E / (V × (V-1)) for directed graphs
Range: 0 (no edges) to 1 (complete graph)
When to Use It
- Network comparison: Compare graphs of different sizes
- Complexity metric: How interconnected is the system?
- Evolution tracking: Is network growing sparser/denser?
Example
Interpretation:
- <0.01: Sparse (most real-world networks)
- 0.01-0.1: Moderately dense
- >0.5: Very dense (rare)
Use Cases
System Complexity
Higher density = more complex system interactions