Of Notes

Macroscopic Mean Values

2 min read · revised 19 October 2026 · referred to by 2 notes · ·

In Basic Graph Theory every quantity we defined belonged to a single node: the degree , the clustering , the distances .

To describe the network as a whole we average these microscopic quantities over all vertices.

Mean Degree

We take the graph with adjacency matrix , order and size .

We sum the degree of every vertex and divide by the number of vertices:

where is the degree of vertex from the matrix notation.

We can evaluate the sum by counting edge endpoints instead. Each of the edges has exactly two endpoints, so summing all degrees counts every edge twice:

Degree Distribution

Instead of summing over vertices we can pick a vertex uniformly at random.

Let be the number of vertices with degree exactly . Then the probability of drawing degree is:

which is a normalized distribution since .

The mean degree is then just the expectation over this distribution:

which is the same number as , only the counting is weighted by how common each degree is rather than by listing every vertex.

Mean Clustering

We apply the same recipe to the local clustering coefficient of each vertex:

where counts how many of the triangles around are closed, see Triangles and the Clustering Coefficient.

Mean Distance

We average the Graph Distance over all pairs of vertices:

where is the shortest path length between and .

We sum over pairs with so that each unordered pair appears exactly once, and we exclude since . There are such pairs, which is where the factor of in front comes from.

This is the quantity which behaves as in the The Small World Experiment.

For a single vertex we drop the outer sum:

and inverting this mean distance is exactly the closeness measure in Centrality.

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card