Searchability of Networks

Simple item page
dc.creatorRosvall, M.
dc.creatorGronlund, A.
dc.creatorMinnhagen, P.
dc.creatorSneppen, K.
dc.date2005-05-17
dc.date2005-12-07
dc.date.accessioned2026-07-07T06:37:48Z
dc.date.available2026-07-07T06:37:48Z
dc.descriptionWe investigate the searchability of complex systems in terms of their interconnectedness. Associating searchability with the number and size of branch points along the paths between the nodes, we find that scale-free networks are relatively difficult to search, and thus that the abundance of scale-free networks in nature and society may reflect an attempt to protect local areas in a highly interconnected network from nonrelated communication. In fact, starting from a random node, real-world networks with higher order organization like modular or hierarchical structure are even more difficult to navigate than random scale-free networks. The searchability at the node level opens the possibility for a generalized hierarchy measure that captures both the hierarchy in the usual terms of trees as in military structures, and the intrinsic hierarchical nature of topological hierarchies for scale-free networks as in the Internet.
dc.description9 pages, 10 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0505400
dc.identifierhttp://arxiv.org/abs/cond-mat/0505400
dc.identifierPhys. Rev. E 72, 046117 (2005)
dc.identifierdoi:10.1103/PhysRevE.72.046117
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100518
dc.subjectDisordered Systems and Neural Networks
dc.titleSearchability of Networks
dc.typetext

Files

Collections

arXiv