Neighbor selection and hitting probability in small-world graphs

DOI10.1214/07-AAP499zbMath1152.60014arXivmath/0702325MaRDI QIDQ957518

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

network evolutionhitting probabilitysmall worldnavigable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Renormalization group analysis of the small-world network model
• Could any graph be turned into a small-world?
• The small-world phenomenon
• Know thy neighbor's neighbor
• Collective dynamics of ‘small-world’ networks
• Navigation in small-world networks: a scale-free continuum model
• Analyzing Kleinberg's (and other) small-world Models
• Efficient routeing in Poisson small-world networks
• Models of the small world.

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