The Structural Evolution of the Web2.0 Service Network
Purpose- The purpose of this research is to analyze empirically the structure of the Web2.0 service network and the mechanism behind its evolution over time. Design/Methodology/Approach - Based on the list of Web2.0 services and their Mashups that is announced on www.programmableweb.com, a network of Web2.0 services was constructed. Within this network, a node represents a Web2.0 service with an open API, and a link between two nodes represents the existence of a Mashup service that uses the two nodes.Findings - Our findings suggest that the evolution of the Web2.0 service network follows the preferential attachment rule, although the exponent of the preferential attachment is lower than for other networks following a preferential attachment rule. Additionally, our results indicate that the Web2.0 service network evolves to a scalefree network, but the exponent of the power law distribution is lower than for other networks as well. Originality/ value - The research applied social network analysis to the Web2.0 service network. It showed that its network structure and the evolution mechanism are different from those found in similar areas, e.g. the WWW. The findings imply that there are factors which lower the exponent of the preferential attachment equation and the power law distribution of the degree centralities. Research limitation/implications - However, we did not investigate the factors responsible for the low values of the exponent of the preferential attachment equation and the exponent of the power law distribution. However, we discussed that it could be correlated with the fact that the interconnection between nodes depends on the property of the nodes.
|Date of creation:||Sep 2009|
|Date of revision:||Sep 2009|
|Publication status:||Published in Online Information Review, vol.33, no.6, December 2009|
|Contact details of provider:|| Postal: 599 Gwanak-Ro, Gwanak-Gu, Seoul 151-744|
Web page: http://temep.snu.ac.kr/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- M. E. J. Newman, 2001. "Clustering and Preferential Attachment in Growing Networks," Working Papers 01-03-021, Santa Fe Institute.
- Freeman, C., 1991. "Networks of innovators: A synthesis of research issues," Research Policy, Elsevier, vol. 20(5), pages 499-514, October.
- Monsuur, Herman, 2007. "Stable and emergent network topologies: A structural approach," European Journal of Operational Research, Elsevier, vol. 183(1), pages 432-441, November.
- Fu, Feng & Liu, Lianghuan & Wang, Long, 2008. "Empirical analysis of online social networks in the age of Web 2.0," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(2), pages 675-684.
- DeBresson, Chris & Amesse, Fernand, 1991. "Networks of innovators :A review and introduction to the issue," Research Policy, Elsevier, vol. 20(5), pages 363-379, October.
When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:200914. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jorn Altmann)
If references are entirely missing, you can add them using this form.