Searchability of Networks

Details Searchability of Networks Searchability of Networks

2005-05-17

arxiv.org/abs/cond-mat/0505400v2

Phys. Rev. E 72, 046117 (2005)

Physics

Condensed Matter

Disordered Systems and Neural Networks

9 pages, 10 figures

Scientific paper

10.1103/PhysRevE.72.046117

We 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.

Affiliated with

Also associated with

No associations

Rating

Searchability of Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Searchability of Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searchability of Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599321