• Title/Summary/Keyword: assortativity

Search Result 4, Processing Time 0.018 seconds

Analysis of Assortativity in the Keyword-based Patent Network Evolution (키워드기반 특허 네트워크 진화에 따른 동종성 분석)

  • Choi, Jinho;Kim, Junguk
    • Journal of Internet Computing and Services
    • /
    • v.14 no.6
    • /
    • pp.107-115
    • /
    • 2013
  • Various networks can be observed in the world. Knowledge networks which are closely related with technology and research are especially important because these networks help us understand how knowledge is produced. Therefore, many studies regarding knowledge networks have been conducted. The assortativity coefficient represents the tendency of connections between nodes having a similar property as figures. The relevant characteristics of the assortativity coefficient help us understand how corresponding technologies have evolved in the keyword-based patent network which is considered to be a knowledge network. The relationships of keywords in a knowledge network where a node is depicted as a keyword show the structure of the technology development process. In this paper, we suggest two hypotheses basedon the previous research indicating that there exist core nodes in the keyword network and we conduct assortativity analysis to verify the hypotheses. First, the patents network based on the keyword represents disassortativity over time. Through our assortativity analysis, it is confirmed that the knowledge network shows disassortativity as the network evolves. Second, as the keyword-based patents network becomes disassortavie, clustering coefficients become lower. As the result of this hypothesis, weconfirm the clustering coefficient also becomes lower as the assortative coefficient of the network gets lower. Another interesting result concerning the second hypothesis is that, when the knowledge network is disassorativie, the tendency of decreasing of the clustering coefficient is much higher than when the network is assortative.

Temperature network analysis of the Korean peninsula linking by DCCA methodology (DCCA 방법으로 연결된 한반도의 기온 네트워크 분석)

  • Min, Seungsik
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.7
    • /
    • pp.1445-1458
    • /
    • 2016
  • This paper derives a correlation coefficient using detrended cross-correlation analysis (DCCA) method for 59 regional temperature series for 40 years from 1976 to 2015. The average temperature, maximum temperature, and minimum temperature series for 4 year units are analyzed; consequently, we estimated that a temperature correlation exists between the two regions during the unit period where the correlation coefficient is greater than or equal to 0.9; subsequently, we construct a network linking the two regions. Based on network theory, average path length, clustering coefficient, assortativity, and modularity were derived. As a result, it was found that the temperature network satisfies a small-worldness property and is a network having assortativity and modularity.

Impact of snowball sampling ratios on network characteristics estimation: A case study of Cyworld (스노우볼 샘플링 비율에 따른 네트워크의 특성 변화: 싸이월드의 사례 연구)

  • Kwak, Hae-Woon;Han, Seung-Yeop;Ahn, Yong-Yeol;Moon, Sue;Jeong, Ha-Woong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.135-139
    • /
    • 2006
  • Today's social networking services have tens of millions of users, and are growing fast. Their sheer size poses a significant challenge in capturing and analyzing their topological characteristics. Snowball sampling is a popular method to crawl and sample network topologies, but requires a high sampling ratio for accurate estimation of certain metrics. In this work, we evaluate how close topological characteristics of snowball sampled networks are to the complete network. Instead of using a synthetically generated topology, we use the complete topology of Cyworld ilchon network. The goal of this work is to determine sampling ratios for accurate estimation of key topological characteristics, such as the degree distribution, the degree correlation, the assortativity, and the clustering coefficient.

  • PDF

Analysis of Geographic Network Structure by Business Relationship between Companies of the Korean Automobile Industry (한국 자동차산업의 기업간 거래관계에 의한 지리적 네트워크 구조 분석)

  • KIM, Hye-Lim;MOON, Tae-Heon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.24 no.3
    • /
    • pp.58-72
    • /
    • 2021
  • In July 2021, UNCTAD classified Korea as a developed country. After the Korean War in the 1950s, economic development was promoted despite difficult conditions, resulting in epoch-making national growth. However, in order to respond to the rapidly changing global economy, it is necessary to continuously study the domestic industrial ecosystem and prepare strategies for continuous change and growth. This study analyzed the industrial ecosystem of the automobile industry where it is possible to obtain transaction data between companies by applying complexity spatial network analysis. For data, 295 corporate data(node data) and 607 transaction data (link data) were used. As a result of checking the spatial distribution by geocoding the address of the company, the automobile industry-related companies were concentrated in the Seoul metropolitan area and the Southeastern(Dongnam) region. The node importance was measured through degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality, and the network structure was confirmed by identifying density, distance, community detection, and assortativity and disassortivity. As a result, among the automakers, Hyundai Motor, Kia Motors, and GM Korea were included in the top 15 in 4 indicators of node centrality. In terms of company location, companies located in the Seoul metropolitan area were included in the top 15. In terms of company size, most of the large companies with more than 1,000 employees were included in the top 15 for degree centrality and betweenness centrality. Regarding closeness centrality and eigenvector centrality, most of the companies with 500 or less employees were included in the top 15, except for automakers. In the structure of the network, the density was 0.01390522 and the average distance was 3.422481. As a result of community detection using the fast greedy algorithm, 11 communities were finally derived.