** Next:** Analogic machine to compute
** Up:** Small world problem estimated
** Previous:** Small world problem estimated
** Contents**

Given a random graph with nodes, . The average number of connections per
node^{6} is M. In other words, each node has
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^{7}.

Tiziano Mengotti
2004-03-27