Small world networks are a type of mathematical graph in which most nodes (representing individuals or entities) are not neighbors of one another, but most nodes can be reached from every other by a small number of steps. This concept was first introduced by Stanley Milgram in his famous "six degrees of separation" experiment. In these networks, nodes are highly clustered, yet the path length between any two nodes is relatively short.
