Neighbor selection and hitting probability in small-world graphs

DOI10.1214/07-AAP499MaRDI QIDQ957518zbMATH OpenFDO

Authors Oskar Sandberg

Publication date 27 November 2008

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0702325

zbMATH Keywords

hitting probabilitynavigablenetwork evolutionsmall world

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Abstract: 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.

Recommendations

• Hitting and commute times in large random neighborhood graphs
• Random walks on small world networks
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Small cliques in random graphs
• On the connectivity and diameter of small-world networks
• Исследование статистик графов ближайших соседей
• Justifying the small-world phenomenon via random recursive trees
• The distribution of the number of node neighbors in random hypergraphs
• Small-world graphs: characterization and alternative constructions
• The Small Giant Component in Scale-Free Random Graphs

Cites work

• Analyzing Kleinberg's (and other) small-world models
• Collective dynamics of `small-world' networks
• Complex networks and decentralized search algorithms
• Could any graph be turned into a small-world?
• Efficient routeing in Poisson small-world networks
• scientific article; zbMATH DE number 1690176 (Why is no real title available?)
• scientific article; zbMATH DE number 2006658 (Why is no real title available?)
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Models of the small world.
• Navigation in small-world networks: a scale-free continuum model
• Renormalization group analysis of the small-world network model
• The small-world phenomenon: an algorithmic perspective

This page was built for publication: Neighbor selection and hitting probability in small-world graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957518)