Volume 83, Number 2, July 2008
|Number of page(s)||5|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||03 July 2008|
Jamming in weighted scale-free gradient networks
ERATO Aihara Complexity Modelling Project, JST, Institute of Industrial Science, The University of Tokyo 4-6-1 Komaba, Meguro-ku, Tokyo, 153-8505, Japan
2 Institute of Industrial Science, The University of Tokyo - Tokyo, Japan
3 Department of Electrical Engineering and Electronics, Osaka Sangyo University - Daito, Osaka, 574-8530, Japan
Accepted: 4 June 2008
In this paper we investigate the jamming degree in weighted scale-free gradient networks, where the gradient flow is described as the edge weight , which is related with the end-point degrees of a link, and α can be adjusted to be or . With the new definition of the jamming coefficient, we numerically calculate the jamming coefficient as a function of α, the connectivity , and the degree exponent γ. The results indicate that for each γ, there exists an optimal value of , at which the jamming coefficient is minimized. The value of depends on the connectivity . With the increase of , shifts from zero to the minimum value we examined. Furthermore, there exists a critical value of , which is numerically estimated to be about 0.5. Namely, when , a homogeneous network will get a higher level of congestion, otherwise, the opposite will happen.
PACS: 89.75.-k – Complex systems / 89.75.Hc – Networks and genealogical trees / 87.23.Ge – Dynamics of social systems
© EPLA, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.