Summary: Search in complex networks
Hari Prasad ThadakamallaHari Prasad Thadakamalla
Email: hpt102@psu.eduEmail: hpt102@psu.edu
Local search in networks
Search with help of only local
information. Each node has the
information of only neighboring
nodes and does not know the
position of the destination node.
Search with help of global
information. The path
obtained is the shortest path.
1 Start node, 30 Destination node.
Path obtained is shown in dashed line 2
Search in structured networks
Spatial network
X
(x30, y30)
(xi, yi) ­ position of a node
Y

Source: Albert, Réka - Departments of Biology & Physics, Pennsylvania State University

Collections: Biology and Medicine