Exploring maps with greedy navigators

@article{Lee2012ExploringMW,
  title={Exploring maps with greedy navigators},
  author={Sang Hoon Lee and Petter Holme},
  journal={Physical review letters},
  year={2012},
  volume={108 12},
  pages={
          128701
        }
}
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… 
View on PubMed
arxiv.org
38 Citations
Background Citations
11
Methods Citations
4

Figures and Tables from this paper

38 Citations

A greedy-navigator approach to navigable city plans
TLDR
It is shown that it is the type of metrics used which determines the overall shapes characterized by structural heterogeneity, but the routing schemes contribute to more subtle details of locality, which is more emphasized in case of unrestricted connections when the edge crossing is allowed.
Navigating temporal networks
Topological Properties and Temporal Dynamics of Place Networks in Urban Environments
TLDR
A novel variant of gravity models is proposed that brings together three essential elements of inter-place connectivity in urban environments: network-level interactions, human mobility dynamics, and geographic distance and is evaluated and finds it outperforms a number of baseline predictors and supervised learning algorithms on a task of predicting new links.
Quantifying navigation complexity in transportation networks
TLDR
This work quantifies the navigation difficulty from an information perspective, which reveals that people conserve a small number of repeatedly used routes and tend to prefer a simplest path, and the navigation information in the real travel network is much smaller than the theoretical value (the global network).
Navigation in spatial networks: A survey
Geometric properties of graph layouts optimized for greedy navigation
TLDR
This work uses a recently developed user-centric navigation protocol to explore spatial layouts of complex networks that are optimal for navigation and discusses the spatial statistical properties of the optimized layouts for better navigability and its implication.
Local-Based Semantic Navigation on a Networked Representation of Information
TLDR
This paper presents a Markov chain based algorithm to tag networked terms according only to their topological features, which is used to compute similarity between terms, providing a map of the networked information.
Navigable networks as Nash equilibria of navigation games
TLDR
It is shown that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks and these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain.
Lost in transportation: Information measures and cognitive limits in multilayer navigation
TLDR
Analysis of the world’s 15 largest metropolitan networks suggests that maps should not consist of more than 250 connection points to be easily readable and that including connections with other transportation modes dramatically increases the information needed to navigate in multilayer transportation networks.
Planarity as a driver of Spatial Network structure
TLDR
This paper introduces a new model of spatial network growth in which nodes are placed at randomly selected locations in space over time, forming new connections to old nodes subject to the constraint that edges do not cross, and allows edges to cross with a defined probability.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
Pathlength scaling in graphs with incomplete navigational information
Spatial Networks
  • M. Barthelemy
  • Computer Science
    Encyclopedia of Social Network Analysis and Mining
  • 2014
Navigating ultrasmall worlds in ultrashort time.
TLDR
It is shown that random scale-free networks are ultrasmall worlds that can be navigated in ultrashort time, implying that the peculiar structure of complex networks ensures that the lack of global topological awareness has asymptotically no impact on the length of communication paths.
Random walks on complex networks.
TLDR
The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes.
Getting Lost in Buildings
People often get lost in buildings, including but not limited to libraries, hospitals, conference centers, and shopping malls. There are at least three contributing factors: the spatial structure of…
Limits of Predictability in Human Mobility
TLDR
Analysis of the trajectories of people carrying cell phones reveals that human mobility patterns are highly predictable, and a remarkable lack of variability in predictability is found, which is largely independent of the distance users cover on a regular basis.
Price of anarchy in transportation networks: efficiency and optimality control.
TLDR
This simulation shows that uncoordinated drivers possibly waste a considerable amount of their travel time, and suggests that simply blocking certain streets can partially improve the traffic conditions.
Universal behavior of load distribution in scale-free networks.
TLDR
It is conjecture that the load exponent is a universal quantity to characterize scale-free networks and valid for both undirected and directed cases.
Navigation in a small world
TLDR
The small-world phenomenon was first investigated as a question in sociology and is a feature of a range of networks arising in nature and technology and is investigated by modelling how individuals can find short chains in a large social network.
Extraction and analysis of traffic and topologies of transportation networks.
  • M. Kurant, P. Thiran
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
It is found that the real-life traffic pattern is very heterogenous, in both space and traffic flow intensities, which makes it very difficult to approximate the node load with a number of topological estimators.
...
...