A Complex Network Analysis of the Weighted Graph of the Web2.0 Service Network
AbstractService 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Seoul National University; Technology Management, Economics, and Policy Program (TEMEP) in its series TEMEP Discussion Papers with number 201178.
Length: 17 pages
Date of creation: Jul 2011
Date of revision: Jul 2011
Publication status: Published in Proceedings of Collective Intelligence 2011
Web2.0 services; mashup; network topology analysis; self-organized networks; small-world networks; scale-free networks; complex networks.;
Find related papers by JEL classification:
- C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- D80 - Microeconomics - - Information, Knowledge, and Uncertainty - - - General
- D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
- L86 - Industrial Organization - - Industry Studies: Services - - - Information and Internet Services; Computer Software
- O31 - Economic Development, Technological Change, and Growth - - Technological Change; Research and Development; Intellectual Property Rights - - - Innovation and Invention: Processes and Incentives
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-08-02 (All new papers)
- NEP-ICT-2011-08-02 (Information & Communication Technologies)
- NEP-NET-2011-08-02 (Network Economics)
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.:
- 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.
- 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.
- 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.
- 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.
- M. E. J. Newman, 2001. "Clustering and Preferential Attachment in Growing Networks," Working Papers 01-03-021, Santa Fe Institute.
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.