File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김철민

Ghim, Cheol-Min
Physical Biology Biological Physics Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 125 -
dc.citation.startPage 105 -
dc.citation.title Lecture Notes in Physics -
dc.citation.volume 650 -
dc.contributor.author Goh, Kwang-Il -
dc.contributor.author Oh, Eulsik -
dc.contributor.author Ghim, Cheol-Min -
dc.contributor.author Kahng, Byungnam -
dc.contributor.author Kim, Doochul -
dc.date.accessioned 2023-12-22T10:44:37Z -
dc.date.available 2023-12-22T10:44:37Z -
dc.date.created 2014-10-10 -
dc.date.issued 2004-08 -
dc.description.abstract We study a problem of data packet transport between a pair of vertices on scale-free network, and introduce load of a vertex as the accumulated sum of a fraction of data packets traveling along the shortest pathways between every pair of vertices. It is found that the load distributions for many real-world networks follow a power law with an exponent which is close to either 2.2(1) (class I) or 2.0 (class II), insensitive to different values of the degree exponent in the range, 2 < < 3. The classification of scale-free networks into the two classes may stem from the characteristics of the shortest pathways structures. While the shortest pathways between a pair of vertices are multiply connected in the class I, they are almost singly connected in the class II. Such distinct topological features of the shortest pathways produce different behaviors in diverse problems such as the distribution of diameter change by the removal of a single vertex. Finally, we remark that since the two numerical values of the load exponent are too close, it still remains an open question if they are really robust. Analytic solution resolving this controversial issue is needed. -
dc.identifier.bibliographicCitation Lecture Notes in Physics, v.650, pp.105 - 125 -
dc.identifier.doi 10.1007/978-3-540-44485-5_5 -
dc.identifier.issn 0075-8450 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/7098 -
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-540-44485-5_5 -
dc.language 영어 -
dc.publisher Springer -
dc.title Classes of the Shortest Pathway Structures in Scale Free Networks -
dc.type Article -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.