分层编号法计算GDURT模型的拉普拉斯谱  

Hierarchical Numbering Method for Calculation of Laplacian Spectra of the GDURT Model

作　　者：赵虎[1] 王丽萍[2] ZHAO Hu;WANG Li-ping(The Computer College of Qinghai Normal University,Xining 810008,China;The State Grid Power of Qinghai,Xining 810008,China)

机构地区：[1]青海师范大学计算机学院,青海西宁810008 [2]青海省电力公司,青海西宁810000

出　　处：《青海师范大学学报(自然科学版)》2015年第1期15-20,共6页Journal of Qinghai Normal University(Natural Science Edition)

基　　金：国家自然科学基金<基于超图理论的复杂网络模型构建及性质研究>(No.61164005)

摘　　要：在URT(Uniform Recursive Tree)模型的基础上提出一种广义的确定性均匀递归树复杂网络演化模型GDURT(Generalized Deterministic Uniform Recursive Tree).通过设计一种能够真实反映网络增长演变特点的最优分层节点编号方法,结合代数化简,找出了GDURT网络的拉普拉斯特征值和特征向量递推关系式,并对GDURT网络的拉普拉斯谱性质做了分析.The GDURT(Generalized Deterministic Uniform Recursive Tree)evolution model of com-plex networks is put forward on the basis of URT(Uniform Recursive Tree)model.The complete recur-sive relations of Laplacian spectra(eigenvalues)and their corresponding eigenvectors are determined by the algebraic reduction and a special optimal layered numbering method for nodes which can really reflect the e-volution characteristics of the networks.Some analysis is made to reveal the main characteristics of Lapla-cian spectra of GDURT networks.

关 键 词：复杂网络 演化模型 确定性均匀递归树 推广 拉普拉斯谱 

分 类 号：TM393.02[电气工程—电机]