dc.citation.endPage |
199 |
- |
dc.citation.number |
2 |
- |
dc.citation.startPage |
193 |
- |
dc.citation.title |
EUROPEAN PHYSICAL JOURNAL B |
- |
dc.citation.volume |
38 |
- |
dc.contributor.author |
Ghim, Cheol-Min |
- |
dc.contributor.author |
Oh, E |
- |
dc.contributor.author |
Goh, KI |
- |
dc.contributor.author |
Kahng, B |
- |
dc.contributor.author |
Kim, D |
- |
dc.date.accessioned |
2023-12-22T11:06:54Z |
- |
dc.date.available |
2023-12-22T11:06:54Z |
- |
dc.date.created |
2014-10-10 |
- |
dc.date.issued |
2004-03 |
- |
dc.description.abstract |
We investigate a problem of data packet transport between a pair of vertices on scale-free networks without loops or with a small number of loops. By introducing load of a vertex as accumulated sum of a fraction of data packets traveling along the shortest pathways between every pair of vertices, it is found that the load distribution follows a power law with an exponent δ. It is found for the Barabasi-Albert-type model that the exponent δ changes abruptly from δ = 2.0 for tree structure to δ ≃ as the number of loops increases. The load exponent seems to be insensitive to different values of the degree exponent γ as long as 2 < γ < 3. |
- |
dc.identifier.bibliographicCitation |
EUROPEAN PHYSICAL JOURNAL B, v.38, no.2, pp.193 - 199 |
- |
dc.identifier.doi |
10.1140/epjb/e2004-00113-2 |
- |
dc.identifier.issn |
1434-6028 |
- |
dc.identifier.scopusid |
2-s2.0-2942536804 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/7120 |
- |
dc.identifier.url |
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=2942536804 |
- |
dc.identifier.wosid |
000221447300009 |
- |
dc.language |
영어 |
- |
dc.publisher |
SPRINGER |
- |
dc.title |
Packet transport along the shortest pathways in scale-free networks |
- |
dc.type |
Article |
- |
dc.description.journalRegisteredClass |
scopus |
- |