Neighbor selection and hitting probability in small-world graphs
<|reference_start|>Neighbor selection and hitting probability in small-world graphs: 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. In several models starting from both discrete and continuous settings, this can be shown to lead to graphs with the desired properties. It also leads directly to an evolutionary model for the creation of similar graphs by the stepwise rewiring of the edges, and we conjecture, supported by simulations, that these too are navigable.<|reference_end|>
@article{sandberg2007neighbor,
    title={Neighbor selection and hitting probability in small-world graphs},
    author={Oskar Sandberg},
    journal={Annals of Applied Probability 2008, Vol. 18, No. 5, 1771-1793},
    year={2007},
    doi={10.1214/07-AAP499},
    number={IMS-AAP-AAP499},
    archivePrefix={arXiv},
    eprint={math/0702325},
    primaryClass={math.PR cs.DS}
}