Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Exploring Maps with Greedy Navigators
Stockholms universitet, Samhällsvetenskapliga fakulteten, Sociologiska institutionen. Umeå University, Sweden; Sungkyunkwan University, Korea.ORCID-id: 0000-0003-2156-1096
Antal upphovsmän: 22012 (Engelska)Ingår i: Physical Review Letters, ISSN 0031-9007, E-ISSN 1079-7114, Vol. 108, nr 12, artikel-id 128701Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global positioning system equipped smartphones, however, a user's ability to access local geometric information and find efficient pathways on networks plays a crucial role, rather than the globally optimal pathways. We present a simple greedy spatial navigation strategy as a probe to explore spatial networks. These greedy navigators use directional information in every move they take, without being trapped in a dead end based on their memory about previous routes. We suggest that the centralities measures have to be modified to incorporate the navigators' behavior, and present the intriguing effect of navigators' greediness where removing some edges may actually enhance the routing efficiency, which is reminiscent of Braess's paradox. In addition, using samples of road structures in large cities around the world, it is shown that the navigability measure we define reflects unique structural properties, which are not easy to predict from other topological characteristics. In this respect, we believe that our routing scheme significantly moves the routing problem on networks one step closer to reality, incorporating the inevitable incompleteness of navigators' information.

Ort, förlag, år, upplaga, sidor
2012. Vol. 108, nr 12, artikel-id 128701
Nationell ämneskategori
Fysik
Identifikatorer
URN: urn:nbn:se:su:diva-162412DOI: 10.1103/PhysRevLett.108.128701ISI: 000301853800008PubMedID: 22540627OAI: oai:DiVA.org:su-162412DiVA, id: diva2:1287568
Tillgänglig från: 2019-02-11 Skapad: 2019-02-11 Senast uppdaterad: 2019-02-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextPubMed

Sök vidare i DiVA

Av författaren/redaktören
Holme, Petter
Av organisationen
Sociologiska institutionen
I samma tidskrift
Physical Review Letters
Fysik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetricpoäng

doi
pubmed
urn-nbn
Totalt: 15 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf