Volume 87, Number 5, September 2009
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||24 September 2009|
Learning paths in complex networks
Department of Economics, Universidade de Brasília - Campus Darcy Ribeiro, Prédio da FACE, Asa Norte, 70910-900 Brasília, Brazil
2 National Institute of Science and Technology for Complex Systems
3 Instituto de Física, Universidade Federal da Bahia - 40210-340 Salvador, Brazil
Accepted: 1 September 2009
This letter addresses the issue of learning shortest paths in complex networks, which is of utmost importance in real-life navigation. The approach has been partially motivated by recent progress in characterizing navigation problems in networks, having as extreme situations the completely ignorant (random) walker and the rich directed walker, which can pay for information that will guide to the target node along the shortest path. A learning framework based on a first-visit Monte Carlo algorithm is implemented, together with four independent measures that characterize the learning process. The methodology is applied to a number of network classes, as well as to networks constructed from actual data. The results indicate that the navigation difficulty and learning velocity are strongly related to the network topology.
PACS: 89.75.Hc – Networks and genealogical trees / 02.70.Uu – Applications of Monte Carlo methods / 89.75.Fb – Structures and organization in complex systems
© EPLA, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.