The Hypernetwork Analysis of the Television Programs Competitive Relationships
SUO Qi1a,2, GUO Jinli1, WANG Fuhong1a
1. a. Business School, b. Center for Supernetwork Research University of Shanghai for Science and Technology, Shanghai 200093, China; 2. School of Economics and Management, Qingdao University of Science and Technology, Qingdao 266061, China
Abstract：The node degrees, weighted node degrees, node hyperdegrees, hyperedge degrees, hyperedge hyperdegrees, average distance and clustering coefficient are proposed in the paper. TV programs are defined as nodes and broadcasting time periods are defined as hyperedges. By using hypernetwork analysis of television programs competitive relationships, we find that the cumulative probability distributions can be described by an exponential distribution. It shows that random factors result in the formation of the hypernetwork. The competition of the supernetwork can be better described by weighted node degrees. The average distance is small and the clustering coefficient is large. These parameters conform to the characteristics of small-world network. These topological characteristics may be useful for the studies of competitive hypernetworks. The methods proposed can also be used for other empirical studies.
索琪, 郭进利, 王福红. 电视节目竞争关系的超网络分析[J]. 复杂系统与复杂性科学, 2016, 13(3): 33-39.
SUO Qi, GUO Jinli, WANG Fuhong. The Hypernetwork Analysis of the Television Programs Competitive Relationships[J]. Complex Systems and Complexity Science, 2016, 13(3): 33-39.
[1] Watts D J, Strogatz S H. Collective dynamics of ‘small-world’ networks [J].Nature, 1998, 393(6684): 440-442. [2] Barabási A L, Albert R. Emergence of scaling in random networks [J].Science, 1999, 286(5439): 509-512. [3] 郭进利. 复杂网络和人类行为动力学演化模型 [M].北京: 科学出版社,2013. [4] Wasserman S, Faust K. Social Network Analysis: Methods and Applications [M].Cambridge: Cambridge University Press, 1994. [5] Ramasco J J, Dorogavtsev S N, Pastor-Satorras R. Self-organization of collaboration networks [J].Physical Review E, 2004, 70(3): 036106. [6] Berge C . Graphs and hypergraphs [M] .New York: Elsevier, 1973. [7] Estrada E, Rodríguez-Velázquez J A. Subgraph centrality and clustering in complex hyper-networks[J].Physica A, 2006, 364: 581-594. [8] Ghoshal G, Zlati＇cV, Caldarelli G, et al. Random hypergraphs and their applications [J].Physical Review E, 2009, 79(6): 066118. [9] Zlati＇cV, Ghoshal G, Caldarelli G. Hypergraph topological quantities for tagged social networks [J].Physical Review E, 2009, 80(3): 036118. [10] 倪子建, 荣莉莉, 刘泉. 基于超网络的维基百科内容知识本体演化研究[J].管理科学学报,2013, 16(12): 68-78. Ni Zijian, Rong Lili, Liu Quan. Study on evolving hypernetwork model of Wiki ontology[J].Journal of Management Sciences in China, 2013, 16(12): 68-78. [11] Wang J W, Rong L L, Deng Q H, et al. Evolving hypernetwork model [J].The European Physical Journal B, 2010,77(4): 493-498. [12] 胡枫, 赵海兴, 马秀娟. 一种超网络演化模型构建及特性分析[J].中国科学,2013, 43(1): 16-22. Hu Feng, Zhao Haixing, Ma Xiujuan. An evolving hypernetwork model and its properities[J].Scientia Sinica, 2013, 43(1): 16-22. [13] Jiang Jifa, Cheng Zhixin. The complete strategic classification for a cooperation-competition model in the WWW market [J].Physical A, 2006, 363 (2): 527-536. [14] Denning P J. What is computer science?[J].American Scientist, 1985, 73(1): 16-19. [15] Estrada E, Rodriguez-Velazquez J A. Subgraph centrality in complex networks[J].Physical Review E, 2005, 71(5): 056103. [16] 王众托. 关于超网络的一点思考[J].上海理工大学学报,2011,33(3): 229-237. Wang ZhongTuo. Reflection on supernetwork[J].J. University of Shanghai for Science and Technology, 2011, 33(3):229-237.
