Global Behaviour of Fixed-Pathways Dynamics in Technological Networks

Complex technological networks usually present distinct characteristics that strongly affect some of its properties.One of them is the fact that the dynamical processes that develop in these networks are usually along predefined pathways, with limited capabilities of seeking alternative routes. One example are large corporation software networks,where several flow processes take place and most of them have predefined paths. In the present work, we propose a simple model to describe the global characteristics of this kind of dynamical interacting processes, where interactions are described as zero-sum games between node pairs. We find that our model delivers interesting and unexpected emerging properties, namely a type of bifurcation transition of the number of efficient processes as a function of the total network load.