Browse > Article
http://dx.doi.org/10.5392/JKCA.2010.10.7.420

Analysis of Extension Pattern for Network of Movie Stars from Korea Movies 100  

Ryu, Jea-Woon (충북대학교 자연과학대학 생화학과)
Kim, Hak-Yong (충북대학교 자연과학대학 생화학과)
Publication Information
The Journal of the Korea Contents Association / v.10, no.7, 2010 , pp. 420-428 More about this Journal
Abstract
The advancement of the Science for complex systems enables the analysis of many social networks. We constructed and analyzed a Korean movie star network as one of social networks, based on the 100 Korean movie selection for a main data source. Until now, the research trend has been the structural analysis of network, focused on link numbers, such as degree, betweenness and clustering coefficient. But it is time that the research is not limited by the structural analysis of networks only. Rather, the research goal should be aimed to an information analysis, performed by identifying and analyzing central modules that are regarded as the core of complex networks, using k-core analysis method. In this research, we constructed a network of movie stars who have appeared in 100 Korean movie selection, provided by Korean movie database, also we analyzed its core modules with and without weights, and the trend of seasonal expansion of the network. We expect our findings can be used as the basic data applicable to a model for understanding of the expansion and evolution of networks.
Keywords
Network; Movie Star; k-core; Evolution of Networks;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 B. Kang, K.-I. Goh, D.-S. Lee, and D. Kim, "Complex networks: structure and dynamics," Sae Mulli, Vol.48, No.2, pp.115-141, 2004.
2 A. Clauset, C. Moore, and M. Newman, "Hierarchical structure and the prediction of missing links in networks," Nature, Vol.453, No.7191, pp.98-191, 2008.   DOI   ScienceOn
3 J. Ignacio, A. Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani, "K-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases," Networks Hetero. Media, Vol.3, No.2, pp.371-393, 2008.   DOI
4 S. Jansom and M. J. Luczak, "A simple solution to the k-core problem," Random Structures & Algorithms, Vol.30, No.1-2. pp.50-62, 2007.   DOI   ScienceOn
5 S. Srivastava and R. K. Ghosh, "Distributed algorithms for finding and maintaining a k-tree core in a dynamic network," Information processing Letters, Vol.88, No.4, pp.187-194, 2003.   DOI   ScienceOn
6 http://www.kmdb.or.kr
7 J. P. Onnela, J. Saramaki, J. Hyvönen, G. Szabo, M. A. de. Menezes, K. Kaski, A.-L. Barabasi, and J. Kertesz, “Analysis of a large-scale weighted network of one-to-one human communication,” New J. Phys., Vol.9 No.6, p.179, 2007.   DOI   ScienceOn
8 M. E. J. Newman and J. Park, "Why social networks are different from other types of networks," Phys. Tev. E, Vol.68, p.036122, 2003.   DOI
9 R. Albert and A.-L. Barabási, "Statistical mechanics of complex network," Rev. Mod. Phys., Vol.74, No.1, pp.47-97, 2002.   DOI   ScienceOn
10 D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman, and S. H. Strogatz, "Are randomly grown graphs really random?" Phys. Rev. E, Vol.64, No.10, p.041902, 2001.   DOI
11 A.-L. Barabasi, R. Albert, and H. Jeong, “Mean-field thoery for scale-free random networks," Physica A, Vol.272, No7. pp.173-187, 1999.   DOI   ScienceOn
12 S. Milgram, "The small world problem," Psychology Today, Vol.1, No.1, pp.60-67, 1967.
13 R. Solomonoff and A. Rapoport, "Connectivity of random nets," Bull. Math. Biophys., Vol.13, No.1 pp.107-117, 1951.   DOI
14 P. Erdös and A. Renyi, "On random graphs," Publicat. Math., Vol.6, No.2 pp.290-297, 1959.
15 R. Albert, H. Jeong, and A.-L. Barabasi, "Internet: Diameter of the world-wide web," Nature, Vol.401, No.6749, pp.130-131, 1999.   DOI
16 H. Jeong, S. P. Mason, A.-L. Barabasi, and Z.N. Oltvai, "Lethality and centrality in protein networks," Nature, Vol.411, No.6833, pp.41-42, 2001.   DOI   ScienceOn
17 H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabasi, "The large-scale organization of metabolic networks," Nature, Vol.407, No.6804, pp.651-654, 2000.   DOI   ScienceOn
18 J. Stiller, D. Nettle, and R. Dunbar, "The small world of Shakespeare's plays," Human Nature, Vol.14, No.4, pp.397-408.   DOI
19 S. Kim, "Complex network analysis in literature: Togi,“ Sae Mulli, Vol.50, No.4, pp.267-271, 2005.
20 Y. K. Lee, H. I. Shin, J. E. Ku, and H. Y. Kim, "Analysis of network dynamics from the Romance of the three kingdoms," J. Kor. Conten. Assoc., Vol.9, No.4, pp.364-371, 2009.   DOI
21 D. Liben-Nowell and J. Kleinberg, "Tracing information flow on a global scale using internet chain-letter data," PNAS, Vol.105, No.12, pp.4633-4638.   DOI   ScienceOn
22 A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, Vol.286, No.5439, pp.509-512, 1999.   DOI   ScienceOn