SlideShare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
SlideShare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Successfully reported this slideshow.
Activate your 14 day free trial to unlock unlimited reading.
1.
Petter Holme
Umeå University, Sungkyunkwan University,
Stockholm University, Institute for Future Studies
Sang Hoon Lee
Umeå University, Oxford University
2.
How can we measure
navigability?
What does optimally
navigable networks look
like?
29.
Optimizing spatial network
for greedy navigators
Fixed vertices
30.
Optimizing spatial network
for greedy navigators
Not fixed vertices
31.
0.2
BA
deviation from shortest path 0 optimized HK
WS
–0.2 Karate Club
2D square
–0.4 1D ring
–0.6
–0.8
–1
–1.2
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
relative position f in greedy paths
32.
0.2
deviation from shortest path BA
0 KK HK
WS
–0.2 Karate Club
2D square
–0.4 1D ring
–0.6
–0.8
–1
–1.2
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
relative position f in GSN paths
33.
Thank you!
SH Lee & P Holme, 2012. Exploring maps with greedy
navigators. Phys. Rev. Lett. 108:128701.
SH Lee & P Holme, 2012. A greedy-navigator
approach to navigable city plans. To appear in Eur.
J. Phys. Spec. Top.
SH Lee & P Holme, 2012. Geometric properties of
graph layouts optimized for greedy navigation.
Under review Phys. Rev. E.