We study the optimal distance ℓopt in random networks in the presence of disorder implemented by assigning random weights to the links. The optimal distance between two nodes is the length of the path for which the sum of weights along the path (“cost”) is a minimum. We study the case of...

Service providers that own Web2.0 services allow Internet users not only to access their Web2.0 services but also to create new Web2.0 services (mashups) based on theirs. This creation of mashups generates the Web2.0 service network, in which a node represents a Web2.0 service and a link between...

In this paper, the relationship between the in-degree and out-degree of World-Wide Web is studies. At each time step, a new node with out-degree kout is added, where kout obeys the power-law distribution and its mean value is m. The analytical and simulation results suggest that the exponent of...

The main objective of the present paper is further to investigate global synchronization of a general model of complex delayed dynamical networks. Based on stability theory on delayed dynamical systems, some simple yet less conservative criteria for both delay-independent and delay-dependent...

An agent-based model is a virtual world comprising distributed heterogeneous agents who interact over time. In a spatial agent-based model the agents are situated in a spatial environment and are typically assumed to be able to move in various ways across this environment. Some kinds of social...

We investigate the performances of collective task-solving capabilities and the robustness of complex networks of automata using the density and synchronization problems as typical cases. We show by computer simulations that evolved Watts–Strogatz small-world networks have superior performance...