Geometric properties of graph layouts optimized for greedy navigation
arXiv:1206.6651 · doi:10.1103/PhysRevE.86.067103
Abstract
The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable cue for various purposes. In this work, we focus on the navigational properties of spatial graphs. We use an recently user-centric navigation protocol to explore spatial layouts of complex networks that are optimal for navigation. These layouts are generated with a simple simulated annealing optimization technique. We compared these layouts to others targeted at better visualization. We discuss the spatial statistical properties of the optimized layouts for better navigability and its implication.
References in corpus (14)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Cooperative Game Theory Approaches for Network Partitioning
- Evolution of networks
- Spatial Networks
- Growing Scale-Free Networks with Tunable Clustering
- Navigability of Complex Networks
- The Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
- Networks and Cities: An Information Perspective
- Behavior of heuristics and state space structure near SAT/UNSAT transition
- Exploring Maps with Greedy Navigators
- A greedy-navigator approach to navigable city plans
- Pathlength scaling in graphs with incomplete navigational information