检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯鹏锋 赵海兴[2] Pengfeng Hou;Haixing Zhao(Department of Mathematics, Qinghai Normal University, Xining;School of Computer Science, Qinghai Normal University, Xining)
机构地区:[1]青海师范大学数学系,西宁 [2]青海师范大学计算机学院,西宁
出 处:《计算机科学与应用》2014年第11期276-281,共6页Computer Science and Application
基 金:科技部973专项(No.2010CB334708);国家自然基金项目(No.61164005);教育部长江学者与创新团队支持计划(No.IRT1068);青海省自然基金项目(No.2012-Z-943)。
摘 要:在过去的的几十年,人们运用各种机制建构了许多不确定性的和确定性的小世界网络。最近,郭世泽等人通过在星图K1,2上运用一个简单的算法在每个迭代步添加一些边首次形成了一个二叉树结构的确定性的小世界网络。本文通过一个星图K1,6在每个迭代步连接每个树的各祖父节点和它的四个孙子节点,由此构建一个二叉树结构的新的确定性的小世界网络模型。此外,我们给出了一些拓扑属性的分析结果,它表明构建的模型是小世界网络。In the past dozen years, many probabilistic small-world networks and some deterministic small- world networks have been proposed utilizing various mechanisms. Recently, Guo et al. proposed a deterministic small-world network model by first constructing a binary-tree structure from star K1,2 by adding some edges in each iteration with a simple mechanism. In this paper, we propose a new deterministic small-world network model by constructing a binary-tree structure from a star K1,6 and then adding links between each grandfather node and its four grandson nodes for each tree in each iteration. Furthermore, we give the analytic solution to several topological characteristics, which shows that the proposed model is a small-world network.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170