How to Use
Select graph:
- H_d: Degree entropy
- H_vN: Von Neumann
- Compare: Measures
Degree Entropy
H_d = -Σᵢ (dᵢ/2m) log₂(dᵢ/2m). Maximum for regular graphs (uniform distribution). Minimum for stars (one high-degree vertex). Measures how 'regular' or 'heterogeneous' the degree distribution is.
Applications
Network complexity: comparing brain networks, social networks. Chemistry: molecular complexity measures. Biology: protein interaction network diversity. Anomaly detection: entropy changes signal structural shifts.
Step-by-Step Instructions
- 1Select graph.
- 2Compute degree entropy.
- 3Compute von Neumann.
- 4Compare measures.
- 5Interpret complexity.