Jamming in complex networks with degree correlation
arXiv:1009.5316 · doi:10.1016/j.physleta.2010.09.050
Abstract
We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport through them. This result agree with the fact that many real world transportation networks naturally evolve to this kind of correlation. We explain our results showing that for the disassortative case the clusters in the gradient network turn out to be as much elongated as possible, reducing the pressure congestion J and observing the opposite behavior for the assortative case. Finally we apply our model to real world networks, and the results agree with our theoretical model.
References in corpus (8)
- Random graphs with clustering
- Optimal Paths in Disordered Complex Networks
- Synchronization in weighed scale-free networks with degree-degree correlation
- Disassortative mixing in online social networks
- Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
- Discrete surface growth process as a synchronization mechanism for scale free complex networks
- Evolution equation for a model of surface relaxation in complex networks
- Optimization in Gradient Networks