Category Archives: Network Science

고길곤, 이경전, “AHP에서의 응답일관성 모수의 통계적 특성과 활용 방안”, 한국경영과학회지, 26(4):71-82, 2001(12월). (PDF) in Korean

ABSTRACT

Using the computer simulation method, we invest19ate the probability distribution of maximum eigenvalue of pair-wise comparison matrix, which has been used as a parameter for measuring the consistency of responses in analytic hierarchy process (AHP). We show that the shape of the distribution of the maximum eigenvalue is different according to the dimension of the matrix. In addition, we cannot find any evidence that the distribution of the Consistency Index is a Normal distribution, which has been claimed in the Previous literature. Accordingly, we suggest using so called K-index calcu1ated based on the concept of cumulative distribution function lather than based on that of arithmetic mean because the probabilistic distribution cannot be assumed to be a Normal distribution. We interpret the simulation results by comparing them with the suggestion of Saaty[11]. Our results show that using Saaty＇s value could be too generous when the dimension of the matrix is 3 and strict over 4. Finally, we propose new criteria for measuring the response consistency in AHP.

오재섭, 이경전, 김재경, 유비쿼터스 사회연결망관리 서비스 모델 설계 분석: u-구인 구직 서비스 모델을 중심으로, Information Systems Review, 13(1), 2011. (PDF) in Korean

ABSTRACT

Although online social network services widely used in human networking and recruiting industries, it is showing off its limitations in followings-it’s hard to reach the status of seamless connection between offline and online; the incompletion and low credibility of the information came from non-face-to-face profile exchange; and the restraint of user autonomy due to centralized control. This paper defines the ubiquitous social network management which enables the seamless real-time face-to-face social interactions of the users based on WPAN (Wireless Personal Area Network) who share the same interest in real word and deduces a ubiquitous social network management framework based on it. As an instance of ubiquitous social network management, u-Recruiting service model will be designed and analyzed. The Analysis using the business model will be followed by the possible scenario of service model. The role, value proposition and potential benefits of the each participants in this service model and will be given as well. In order to evaluate relative advantages of the model suggested by this study, 6 cases will be compared.

오재섭, 이경전, 사회연결망 관리의 개념 연구와 사회연결망관리 프레임워크 개발, Internet and Information Security, 2(1), 2011. (PDF) in Korean

ABSTRACT

Social network service have shown dramatic growth, especially in the personal connection management, contents distribution, marketing, recruiting and software development sectors. The representative examples of thriving online social network services include Facebook, LinkedIn, Twitter and MySpace. Recently, social network services are being considered beyond a social network among individual users, and are being reviewed from business perspectives. Businesses focus on job recommendations, contents distribution, advertising and marketing, and the potential influences and opportunities provided by the social network services in terms of business are continuously growing. In this context, individuals and businesses require in-depth and broad concepts for building closer relations with acquaintances and customers through related processes and resources, To this end, this study suggests a social network management framework that provides a basic understanding of social network management from process theory and resource-based view. This study also evaluates the social network management framework based on the evaluation criteria for conceptual frameworks.

Ko, K., Lee, K., Park, C., Rethinking Preferential Attachment Scheme in the dynamic network: Degree centrality or closeness centrality?, Connections 27(3):53-59, 2007. ISSN 0226-1776. pdf

Abstract

Construction of realistic dynamic complex network has become increasingly important. One of widely known approaches, Barabasi and Albert’s “scale-free” network (BA network), has been generated under the assumption that new actors make ties with high degree actors. Unfortunately, degree, as a preferential attachment scheme, is limited to a local property of network structure, which social network theory has pointed out for a long time. In order to complement this shortcoming of degree preferential attachment, this paper not only introduces closeness preferential attachment, but also compares the relationships between the degree and closeness centrality in three different types of networks: random network, degree preferential attachment network, and closeness preferential attachment network. We show that a high degree is not a necessary condition for an actor to have high closeness. Degree preferential attachment network and sparse random network have relatively small correlation between degree and closeness centrality. Also, the simulation of closeness preferential attachment network suggests that individuals’ efforts to increase their own closeness will lead to inefficiency in the whole network.