Learn More
Traffic is constrained by the information involved in locating the receiver and the physical distance between sender and receiver. We here focus on the former, and investigate traffic in the perspective of information handling. We replot the road map of cities in terms of the information needed to locate specific addresses and create information city(More)
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally hierarchical. Comparison with these extremal cases as well as with random scale-free networks allows us to better(More)
The phase transition in the XY model on one-dimensional small-world networks is investigated by means of Monte Carlo simulations. It is found that long-range order is present at finite temperatures, even for very small values of the rewiring probability, suggesting a finite-temperature transition for any nonzero rewiring probability. Nature of the phase(More)
A two-dimensional small-world-type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node, with a finite density of directed random links to the other nodes in the network, is numerically investigated. It is shown that the degree of cooperation does not remain at a steady state level but displays(More)
We study Nowak and May's spatial prisoners' dilemma game driven by mutations (random choices of suboptimal strategies) on empirical social networks. The time evolution of the cooperation level is highly complex containing spikes and steps between quasistable levels. A statistical characterization of the quasistable states and a study of the mechanisms(More)
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(More)
It is suggested that the degree distribution for networks of the cell-metabolism for simple organisms reflects a ubiquitous randomness. This implies that natural selection has exerted no or very little pressure on the network degree distribution during evolution. The corresponding random network, here termed the blind watchmaker network has a power-law(More)