Complex technological networks represent a growing challenge to support and maintain as their number of elements become higher and their interdependencies more involved. On the other hand, for networks that grow in a decentralized manner, it is possible to observe certain patterns in their...

Many real-world systems can be represented by bipartite networks. In a bipartite network, the nodes are divided into two disjoint sets, and the edges connect nodes that belong to different sets. Given a bipartite network (i.e. two-mode network) it is possible to construct two projected networks...

We extend the study of a model of competitive cluster growth in an active medium from a regular topology to a complex network topology; this is done by adding nonlocal connections with probability p to sites on a regular lattice, thus enabling one to interpolate between regularity and full...

In this paper the robustness of network synchronizability against random deletion of nodes, i.e. errors, in dynamical scale-free networks was studied. To this end, two measures of network synchronizability, namely, the eigenratio of the Laplacian and the order parameter quantifying the degree of...

We present a generic threshold model for the co-evolution of the structure of a network and the binary state of its nodes. We focus on regular directed networks and derive equations for the evolution of the system toward its absorbing state. It is shown that the system displays a transition from...

We model the information traffic on scale-free networks considering the packets’ limited lifetime. In previous papers, an order parameter η, which reflects the accumulation of packets, has been employed to estimate traffic congestion; if η0, the traffic system is in the congestion state....