A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very little knowledge of the graph itself. In an attempt to understand how such graphs arise we introduce a different criterion for graphs to be navigable in this sense, relating the neighbor selection of a vertex to the hitting probability of routed walks. Indoi:10.1214/07-aap499 fatcat:ualn2vihazegffbnvxmbgmj2vm