Reachability Does Not Imply Searchability in Expanding Networks
Routing and search respond in opposite ways to rapid network expansion. Short graph distances make a known destination easy to reach, while the neighborhood accessible within a few hops can be vastly larger than any finite inspection budget. We show that this tension imposes an algorithm-independent constraint on spars...