Show simple item record

dc.contributor.authorLin, H.zh_CN
dc.contributor.authorWua, C. -X.zh_CN
dc.contributor.author林辉zh_CN
dc.date.accessioned2015-07-22T07:23:27Z
dc.date.available2015-07-22T07:23:27Z
dc.date.issued2006-06zh_CN
dc.identifier.citationEUROPEAN PHYSICAL JOURNAL B, 2006,51(4):543-547zh_CN
dc.identifier.otherWOS:000238670700010zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/91692
dc.description.abstractThe congestion transition triggered by multiple walkers walking along the shortest path on complex networks is numerically investigated. These networks are composed of nodes that have a finite capacity in analogy to the buffer memory of a computer. It is found that a transition from free-flow phase to congestion phase occurs at a critical walker density f(c), which varies for complex networks with different topological structures. The dynamic pictures of congestion for networks with different topological structures show that congestion on scale-free networks is a percolation process of congestion clusters, while the dynamics of congestion transition on non-scale-free networks is mainly a process of nucleation.zh_CN
dc.language.isoen_USzh_CN
dc.publisherEUR PHYS J Bzh_CN
dc.source.urihttp://dx.doi.org/10.1140/epjb/e2006-00249-yzh_CN
dc.subjectMODELzh_CN
dc.titleDynamics of congestion transition triggered by multiple walkers on complex networkszh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record