Small World Graphs

Small World Parameters

• size of network: $n = 1,000,000$
• number of “out” edges: $k = 8$
  • by default, vertex $i $ forms edge with $i + 1, i + 2, \ldots, i + k$
• probability of rewiring: $p $
  • for each out edge, with probability $p$ pick a random vertex $j$ from $0$ to $n - 1$ and add edge from $i $ to $j $

Average Distance to Random Node