The theory of Smax graph does not seem to work in a real case study
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 401-412 |
Journal / Publication | Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms |
Volume | 13 |
Issue number | 3-4 |
Publication status | Published - Jun 2006 |
Link(s)
Abstract
A recent study has shown that the power-law degree distribution alone may not guarantee a network be scale-free. Meanwhile, a structural metric was formulated to represent the extent to which a network is scale-free, where a new concept of smax graph was suggested, associated with a measure of a network being fully scale-free. Following this approach, in our recent investigation of a real competitive relationship network of enterprises in the software industry in Guangzhou city, China, we constructed and analyzed the smax graph of the real network, hoping that this case study could help us confirm the seemingly attractive new theory. It turns out, however, that the concept of smax graph does not preserve many essential features of the real network. To that end, the main reason for the failure of the original concept of smax graph is discussed, with a possible remedy suggested for future research. Copyright © 2006 Watam Press.
Research Area(s)
- Competitive relationship network, Power-law distribution, Smax graph, Scale-free network
Citation Format(s)
The theory of Smax graph does not seem to work in a real case study. / Yang, Jianmei; Zhuang, Dong; Chen, Guanrong.
In: Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms, Vol. 13, No. 3-4, 06.2006, p. 401-412.
In: Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms, Vol. 13, No. 3-4, 06.2006, p. 401-412.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review