Path Length and Reachability Mapping¶

Why It Matters¶

Proximity in physical space misleads us about proximity in network space. Two people in the same building might be 8 steps apart socially; two people on different continents might be 2 steps apart. Path length determines transmission speed (information, disease, influence), discovery time (finding relevant resources), and coordination feasibility (how many intermediaries must align). Short paths enable rapid diffusion; long paths create isolation and independent evolution.

The Key Move¶

When evaluating whether something can spread/propagate/be-found, trace the actual paths through the network rather than assuming direct connections. Count intermediary steps. Identify disconnected components where no path exists. Check if critical paths bottleneck through specific nodes. Ask: what's the typical number of hops needed, what's the worst case, and which nodes serve as bridges?

Classic Application¶

Milgram's small-world experiments sending letters through social networks found average path length around 6 ("six degrees of separation"). This revealed that social networks have surprisingly short paths despite huge size - you can reach almost anyone through a chain of acquaintances. The finding transformed understanding of information flow and disease transmission.

Surprising Application¶

Knowledge acquisition strategy. When learning a new domain, map the concept network by identifying which ideas depend on which prerequisites. Path length from your current knowledge to target concepts determines learning time. Common error: trying to jump directly to advanced topics (assuming short paths) when actual dependency chains require 5-7 intermediate concepts. Explicitly mapping paths prevents frustration and reveals efficient learning sequences.

Failure Modes¶

Confusing shortest paths with actual paths - real information follows social paths shaped by trust, not just topological shortest routes. Ignoring directionality - paths may exist in one direction but not reverse (who-influences-whom networks). Assuming paths remain stable - dynamic networks have paths that appear and disappear. Missing weighted paths - the "shortest" path by hop count may be longest by time, cost, or friction.

Go Deeper¶

Watts, "Six Degrees: The Science of a Connected Age"; Easley & Kleinberg, "Networks, Crowds, and Markets" Chapter 20 (Small World Phenomenon)

Friction - Military Strategy & Strategic Thinking: A Map of the Territory