Java Applets
Research topics
Hide and Seek on Networks
Navigation is a challenging problem for everyday life. The problem arises because the amount of available information typically is limited and often insufficient. We here abstract this problem to be navigation between a source and a target node on a network. Thus we characterize the relative position of two node sin the network in terms of the minimal information needed to find the shortest path betweem them. Thereby we can discuss and quantify positions in the network in terms of their visibility (hide) respectively how easy they give access to other nodes (seek).
Publications
K. Sneppen, A. Trusina, M. Rosvall
cond-mat/0407055
Hide and Seek on Complex Networks
Europhys. Lett. 69
(2005)cond-mat/0407055
A. Trusina, M. Rosvall, K. Sneppen
cond-mat/0412064
Communication Boundaries in Networks
Phys. Rev. Lett. 94
(2004)cond-mat/0412064
M. Rosvall, A. Gronlund, P. Minnhagen, K. Sneppen
cond-mat/0505400
Searchability of Networks
Phys. Rev. E 72
(2005)cond-mat/0505400
M. Rosvall, P. Minnhagen, K. Sneppen
cond-mat/0412051
Navigating Networks with Limited Information
Phys. Rev. E. 71
(2005)cond-mat/0412051
M. Rosvall, A. Trusina, P. Minnhagen, K. Sneppen
cond-mat/0407054
Networks and Cities: An Information Perspective
Phys. Rev. Lett 94
(2005)cond-mat/0407054
M. Rosvall and K. Sneppen
0809.4803
Reinforced communication and social navigation generate groups in model networks
Phys. Rev. E 79
(2009)0809.4803
L. Lizana, M. Rosvall and K. Sneppen
0910.4045
Time walkers and spatial dynamics of ageing information
Phys. Rev. Lett. 104
(2010)0910.4045



