Guided Search and Distribution of Information Flow on Complex Graphs

Abstract

Abstract. Within the numerical model proposed in [1] we study the flow of information on a graph with power-law organization of links and an emergent superstructure formed by two highly interconnected hubs. The local search algorithms which navigate transport at each node can use information in the range of zero, one, and two-nearest neighbourhood of the node. We show how the flow carried by a particular link is distributed over graph when range of guided search and posting rate of packets are varied. The probability density function of the flow is given by a universal log-normal law, which is determined by the overall packet density in the stationary traffic. However, the distribution becomes unstable when the traffic experiences temporary or permanent jamming.

Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks

“…The second example shows that RWPM can be applied in transportation to design more efficient routing strategy. In recent years, the issue of transportation on complex networks attracted a lot of attention from researchers in this field [18][19] [20][21] [22][23] [24]. One of the most important problems in transportation is to balance load on nodes and edges across the whole network so as to enhance the network's overall transporting capacity.…”