small-world network

(mathematics) A kind of graph in which most nodes are not neighbors but most can be reached from every other by a small number of steps, i.e. the typical distance between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes in the network.