simple undirected network density
represents the ratio of the actual number of edges to the total number of possible edges.
symbols, variables and units
m: number of edges; n: number of nodes; D: dimensionless.
applicable conditions and boundaries
n≥2, simple undirected graph without self-loop; the denominators of directed graphs are different.
formula source code
The following is a copyable LaTeX expression.
D=\frac{2m}{n(n-1)}Reference and Extended Learning
MIT OpenCourseWare · Network Science ↗is organized according to model definition and assumptions. Please check actual conditions and original literature before engineering, research and clinical use.
graph densitynetwork