network average degree
Calculates the average number of connections from the number of nodes and edges.
symbols, variables and units
m: number of undirected edges; n: number of nodes; k: node degree, dimensionless.
applicable conditions and boundaries
is an undirected graph, and its degree is calculated as each edge contributing two endpoints.
formula source code
The following is a copyable LaTeX expression.
\langle k\rangle=\frac{2m}{n}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.
average degreeNetwork Science