Both Random and Preferential Attachment —the Inner Motivation in the Evolution of Hypernetworks
SUO Qi1,2 , GUO Jinli1
1. Business School, 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：An evolving hypernetwork model is constructed with both preferential and random attachment. We analyze the model by using Poisson process theory and a continuous technique, and obtain the stationary average hyperdegree distribution of the hypernetwork. The analytical result shows that the stationary average hyperdegree distribution can be described with “shifted power law” (SPL) function form. Our model is also universal, in that the standard model in complex networks and scale-free model in hypernetworks can all be seen as degenerate cases of the model. By adjusting the parameter, the model can reflect the mixed-connection mechanism. In addition, three empirical data are analyzed, and can be effectively described by the model.
索琪, 郭进利,. “随机”与“择优”——超网络演化的内在驱动力[J]. 复杂系统与复杂性科学, 2016, 13(4): 51-55.
SUO Qi , GUO Jinli. Both Random and Preferential Attachment —the Inner Motivation in the Evolution of Hypernetworks[J]. Complex Systems and Complexity Science, 2016, 13(4): 51-55.
[1] Barabási A L, Albert R. Emergence of scaling in random networks[J].Science, 1999, 286 (5439): 509-512. [2] 王众托. 关于超网络的一点思考[J].上海理工大学学报, 2011, 33(3): 229-237. Wang Zhongtuo. Reflection on supernetwork[J].University of Shanghai for Science and Technology, 2011, 33(3):229-237. [3] Lü L, Medo M, Yeung C H, et al. Recommender systems[J].Physics Reports, 2012, 519(1): 1-49. [4] Berge C. Graphs and Hypergraphs[M].Amsterdam: North-Holland Publishing Company, 1973. [5] Zhang Z K, Liu C. A hypergraph model of social tagging networks[J].Journal of Statistical Mechanics: Theory and Experiment, 2010, (10): P10005. [6] 裴伟东, 夏玮, 王全来,等. 多三角形结构动态复杂网络演化模型及其稳定性分析[J].计算机工程与应用, 2011, 47(23): 41-44. Pei Weidong, Xia Wei, Wang Quanlai, et al. Study of dynamic complex network evolving models with multi-triangular structure[J].Computer Engineering and Applications, 2011, 47(23): 41-44. [7] Wang J W, Rong L L, Deng Q H, et al. Evolving hypernetwork model[J].The European Physical Journal B-Condensed Matter and Complex Systems, 2010, 77(4): 493-498. [8] 胡枫, 赵海兴, 马秀娟. 一种超网络演化模型构建及特性分析[J].中国科学, 2013, 43(1): 16-22. Hu Feng, Zhao HaiXing, Ma XiuJuan. An evolving hypernetwork model and its properties[J].Scientia Sinica:Physica, Mechanica & Astronomica, 2013, 43 (1): 16-22. [9] Yang G Y, Hu Z L, Liu J G. Knowledge diffusion in the collaboration hypernetwork[J].Physica A: Statistical Mechanics and its Applications, 2015, 419: 429-436. [10] 郭进利, 祝昕昀.超网络中标度律的涌现[J].物理学报, 2014, 63(9): 90207. Guo Jinli, Zhu Xinyun. Emergence of Scaling in Hypernetworks[J].Acta Physica Sinica, 2014, 63(9): 90207. [11] 郭进利. 非均齐超网络中标度律的涌现——富者愈富导致幂律分布吗[J].物理学报, 2014, 63(20): 208901. Guo Jinli. Emergence of scaling in non-uniform hypernetworks——does “the rich get richer” lead to a power-law distribution[J].Acta Physica Sinica, 2014, 63(20): 208901. [12] Liu Z, Lai Y C, Ye N, et al. Connectivity distribution and attack tolerance of general networks with both preferential and random attachments[J].Physics Letters A, 2002, 303(5): 337-344. [13] Li X, Chen G. A local-world evolving network model[J].Physica A: Statistical Mechanics and its Applications, 2003, 328(1): 274-286. [14] Zhang P P, Chen K, He Y, et al. Model and empirical study on some collaboration networks[J].Physica A: Statistical Mechanics and its applications, 2006, 360(2): 599-616. [15] Fu C H, Zhang Z P, Chang H, et al. A kind of collaboration-competition networks[J].Physica A: Statistical Mechanics and its Applications, 2008, 387(5): 1411-1420. [16] Estrada E, Rodriguez-Velazquez J A. Subgraph centrality in complex networks[J].Physical Review E, 2005, 71(5): 056103. [17] Estrada E, Rodriguez-Velazquez J A. Subgraph centrality and clustering in complex hyper-networks[J].Physica A:Statistical Mechanics and its Applications, 2006, 364: 581-594.
