Stating the problem

Given a random graph $G$ with $N$ nodes, $G(N,E)$. The average number of connections per node⁶ is M. In other words, each node has $M$ connections to other nodes. Take randomly two nodes out of the graph: what is the average path length between these two nodes? To compute the average path length, we always choose the shortest distance⁷.