A Complex Network Analysis of the Weighted Graph of the Web2.0 Service Network
Service providers that own Web2.0 services allow Internet users not only to access their Web2.0 services but also to create new Web2.0 services (mashups) based on theirs. This creation of mashups generates the Web2.0 service network, in which a node represents a Web2.0 service and a link between two nodes represents a mashup using the two Web2.0 services linked. Since this Web2.0 service network is constructed without the control of a single entity (i.e., it is self-organizing), the network topology of the Web2.0 service network shows the scale-free characteristic. With respect of the weighting of those links, however, there are different approaches. Prior research either considered binary links or links that are weighted by summing up the number of mashups. Since the last approach might overestimate the strength of the link, we calculate the link weights according to Newman’s approach in this paper. Based on this weighted graph of the Web2.0 service network, we investigate the topology of the weighted graph and examine the pattern of Web2.0 service creations. Our results show that the Newman-based weighted graph of the Web2.0 service network shows the characteristics of a scale-free network and a small-world network.
|Date of creation:||Jul 2011|
|Date of revision:||Jul 2011|
|Publication status:||Published in Proceedings of Collective Intelligence 2011|
|Contact details of provider:|| Postal: |
Web page: http://temep.snu.ac.kr/
More information through EDIRC
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.:
- Kibae Kim & Jorn Altmann & Junseok Hwang, 2010. "Measuring and Analyzing the Openness of the Web2.0 Service Network for Improving the Innovation Capacity of the Web2.0 System through Collective Intelligence," TEMEP Discussion Papers 201057, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Mar 2010.
- O'Reilly, Tim, 2007. "What Is Web 2.0: Design Patterns and Business Models for the Next Generation of Software," MPRA Paper 4578, University Library of Munich, Germany.
- M. E. J. Newman, 2001. "Clustering and Preferential Attachment in Growing Networks," Working Papers 01-03-021, Santa Fe Institute.
- B. J. Kim & A. Trusina & P. Minnhagen & K. Sneppen, 2005. "Self organized scale-free networks from merging and regeneration," The European Physical Journal B - Condensed Matter and Complex Systems, Springer, vol. 43(3), pages 369-372, 02.
- 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.
- Junseok Hwang & Jorn Altmann & Kibae Kim, 2009. "The Structural Evolution of the Web2.0 Service Network," TEMEP Discussion Papers 200914, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Sep 2009.
When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:201178. 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.