Relative Degree Structural Hole Centrality,CRD−SH: A New Centrality Measure in Complex Networks

In order to assess influential nodes in complex networks, the authors propose a novel ranking method based on structural hole in combination with the degree ratio of a node and its neighbors. The proposed method is a response to the limitations of other proposed measures in this field. The structural hole gives a comprehensive attention of the information about the node topology in relation to its neighbors, whereas the degree ratio of nodes reflects its significance against the neighbors.Combination of the two aforementioned measures summarized in the structural hole leverage matrix demonstrates the importance of a node according to its position in the network structure. So a more accurate method for ranking influential nodes is established. The simulation results over different-scale networks(small networks with less than 30 nodes, medium networks with less than 150 nodes and large networks with more than 1000 nodes) suggest that the proposed method can rank important nodes more effectively and precisely in complex networks specifically in larger ones.     

基于复杂网络特征的背包问题优化算法

根据复杂网络演化过程中的小世界现象及无标度特征,提出了基于复杂网络的背包问题优化算法。该算法基于无标度特征的背包问题形成优化空间,通过节点增长和加权节点度偏好连接,产生优化空间网络及其节点度分布;在该优化空间网络中,以小世界网络的聚类及小世界效应为基础,以节点度分布为先验知识,提出局部聚类、小世界效应、链集优化和节点寻优4个算子,实现网络节点连接优化。利用马尔科夫链的相关性质,证明了该算法的收敛性。针对具有相关性的0/1背包问题的实验结果表明,该算法解决组合优化问题是有效的。     

能量平衡的异构传感网跨层密钥管理方案

传统的传感网密钥管理协议独立于网络其他层设计,这种层间的独立性造成传感器节点物理性能浪费,网络整体性能降低。从节点剩余能量出发,提出一个能量平衡的异构传感网跨层密钥管理方案。通过节点剩余能量、节点度数等参数,从能量平衡的角度出发确定下一跳节点的选择,再利用密钥交换建立两节点间的会话密钥,该方案将网络层节点路由关系与应用层节点密钥关系结合,实现了密钥管理的跨层设计。结果表明,该方案保证节点密钥连通性的同时,均衡网络节点间的能耗关系,有效延长了异构传感网的生命周期。     

可变相关系数网络病毒传播仿真研究

针对复杂网络中相连节点之间的度相关性与病毒传播之间的关系,基于经典病毒传播模型SIS和SIR,研究了BA无尺度网络、ER随机网络及技术网络、社会网络等真实世界网络上的病毒传播行为。通过连续改变已知网络的度相关系数,来观察病毒传播的变化情况。仿真结果表明,异配网会络加速病毒的传播,而传播速度对同配网络具有更高的敏感性,且同配网络传播临界值较低。此外,目标免疫对异配网络具有更有效的免疫效果。     

Exploring Community Collaborations: Social Network Analysis as a Reflective Tool for Public Health

Social network analysis is a potentially useful reflective tool that could be used by public health practitioners to assess the overall composition of their networks, strengthen collaborations with other community partners, and evaluate network function. The purpose of this paper is to report on public health practitioners’ experiences with social network analysis. Thirteen public health practitioners, each associated with their own advocacy-oriented community collaboration, participated in the study. Specifically, the intervention consisted of social network analysis output (social network analysis measures and sociograms) and a facilitated discussion to stimulate reflection on the respondents’ professional networks. Semi-structured interviews were conducted two weeks later to solicit participants’ reactions to the sociograms and the accompanying measures, and elicit thoughts about how social network analysis might have an impact on their work. Participants commented on ways in which social network analysis could be applied in practice, such as using sociograms to raise awareness of the nature of current networks, as a planning and evaluation tool, to identify gaps, and to assess the degree of sustainability of current networks.     

基于节点标号的Koch网络结构性质研究

针对正多边形Koch分形岛所映射成的Koch网络,根据节点接入网络的时间和位置信息给节点标号。在节点标号的基础上,研究网络的最短路由及计算最短路径长度;并分析网络的主要结构性质,如节点的度、度分布和累积度分布函数,以及网络的聚类系数、平均最短路径长度、度关联函数和介数中心性,得出结构性质的解析解。结果表明,所构建的Koch网络是无标度和小世界的;其聚类系数趋向于比较大的常数值;平均路径长度与网络节点数的对数呈正比关系,度相关函数、点介数和边介数都随节点度的变化而指数变化。     

Random walk search in unstructured P2P

1 .INTRODUCTIONIn the last few years , unstructured P2P applicationsare very popular ,such as Gnutella[1], Kazaa[2]. Theyare designed for sharing files among the peers in thenetworks .Thereis no precise control over the networktopology or file placement in these systems .In gener-al ,they employ flooding scheme for searching object ,and waste a lot of bandwidth[1]. Today , bandwidthconsumption attributed to these applications amountsto a considerable fraction (upto 60 %) of the total In…     

A complex systems science perspective on wireless networks

The paper targets a future world where all wireless networks are self-organising entities and in which the predominant mode of spectrum access is dynamic. The paper explores whether the behaviour of a collection of autonomous self-organising wireless systems can be treated as a complex system and whether complex systems science can shed light on the design and deployment of these networks. The authors focus on networks that self-organise from a frequency perspective to understand the behaviour of a collection of wireless self-organising nodes. Each autonomous network is modelled as a cell in a lattice and follows a simple set of self-organisation rules. Two scenarios are considered, one in which each cell is based on cellular automata and which provides an abstracted view of interference and a second in which each cell uses a self-organising technique which more accurately accounts for interference. The authors use excess entropy to measure complexity and in combination with entropy gain an understanding of the structure emerging in the lattice for the self-organising networks. The authors show that the self-organising systems presented here do exhibit complex behaviour. Finally, the authors look at the robustness of these complex systems and show that they are robust against changes in the environment.     

基于超网络的作战信息流转建模及特性分析

针对现有单一要素模式的信息网络不能有效反映作战信息流转复杂结构及动态过程的问题,提出一种基于超网络的作战信息流转"两层三网"模型构建及特性分析方法。首先,分析作战信息流转超网络结构特征,抽象作战节点和信息关系的多维属性,定义关联映射规则,建立作战信息流转超网络模型;其次,从节点的超度分布、超边的度分布、介数、聚类系数、子图向心性和网络弹性6个方面,研究了作战信息流转超网络的拓扑特性。最后,以空中突击作战为例,通过仿真实验,验证了模型与方法的可行性和合理性。     

择优选择节点构成的复杂网络模型研究

针对Barabasi-Albert无标度网络模型(BA模型)模拟现实世界的局限性,在其算法基础上作了适当扩展,将原算法中新节点加入每次依概率全局择优的机制改为首先全局择优选择节点构成初始模型后,新节点以等概率连接的机制,并依新算法生成扩展BA模型。依据二者度分布等静态统计量性质进行性态比较,证实了扩展模型的拓扑结构和发展状况更接近于现实网络,并且扩展模型生成网络的鲁棒性更好。     

无标度网络的一个新的拓扑参数

为更深刻直观地定量刻划无标度网络的拓扑性质,将经济学中描述收入分配不均等程度的两个重要概念:洛伦茨曲线和基尼系数推广至一般的复杂网络.通过仿真和理论两个方面的工作,指出将这两个概念与幂律相结合可以更有效地刻划无标度网络的拓扑结构的异质性,同时还获得了关于无标度网络的一些重要性质.最后对基尼系数和网络结构熵进行了比较.     

Hierarchical structure discovery in social networks北大核心CSCD

According to the fact that the conventional social network analysis methods did not consider the role of network property, such as social individuals' position, the strength of social relations. We introduced a new social network model based on extended graph and hierarchical structure based on information flow. Also, we proposed a method for discovering the backbone nodes based on the Network Topology Potential Support and a method for discovering the network hierarchy based on the potential flow. The experimental results show the effectiveness of our method in mining the hierarchical structure of networks. ©, 2015, The Journal Agency of Complex Systems and Complexity Science. All right reserved.     

A New Evaluation Method of Node Importance in Directed Weighted Complex Networks

Current researches on node importance evaluation mainly focus on undirected and unweighted networks, which fail to reflect the real world in a comprehensive and objective way. Based on directed weighted complex network models, the paper introduces the concept of in-weight intensity of nodes and thereby presents a new method to identify key nodes by using an importance evaluation matrix. The method not only considers the direction and weight of edges, but also takes into account the position importance of nodes and the importance contributions of adjacent nodes. Finally, the paper applies the algorithm to a microblog-forwarding network composed of 34 users, then compares the evaluation results with traditional methods. The experiment shows that the method proposed can effectively evaluate the node importance in directed weighted networks.     

中国高校电子邮件网络实证研究

为了挖掘社会网络中人与人之间的交流方式,利用日志数据分析国内某高校电子邮件网络的特性。提取了两种网络：非交互网络和交互网络。结果发现两种网络均有很强的度和强度相关性,但是同配异配性质并不明显。此外,发现高强度节点之间存在富人俱乐部现象,而大度节点之间不存在此现象。最后利用加权适应度算法划分了加权网络的社团结构,发现社团规模累积分布满足幂律分布。结论为进一步建模仿真提供了实证基础。     

一种新的环型蓝牙网络拓扑形成协议及仿真

根据采用蓝牙技术的无线ad hoc网络的特点，提出了一种分布式的环型蓝牙网络拓扑形成协议。协议采用合并的思想，将节点快速姐奴成一个环型网络，且新节点可以随时加入网络．协议具有拓扑形成过程延迟低、控制开销小的特点，控制开销复杂度为O（N），且形成了平均微微网个数少、每节点度数低的蓝牙网络，网络中最多包含‘（N-2）／（k-1）’＋1个微微网，至少包含‘N/k’个微微网，节点最大度数为2。基于NS2的仿真实验评估了协议的性能，实验结果验证了协议形成了具较佳性能的环型蓝牙网络。     

Distributed event region fault-tolerance based on weighted distance for wireless sensor networks

Event region detection is the important application for wireless sensor networks (WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service. Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance (DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information. In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node. Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node. Simultaneously, readings of faulty sensors would be corrected during this process. Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.     

智能制造企业创新关联网络结构对技术生态位的影响

以中国智能制造上市企业2015～2020年发明专利授权数为样本,运用社会网络分析方法揭示智能制造企业创新关联网络演化规律。通过回归分析,研究智能制造企业创新关联网络结构与技术生态位“态”和技术生态位“势”的关系。研究发现：智能制造企业创新关联网络关系显著,且关联趋向紧密。网络度数中心度与技术生态位“态”、技术生态位“势”均呈显著的倒U关系;关系强度与技术生态位“态”、技术生态位“势”均呈显著的倒U关系;结构洞与技术生态位“态”的关系呈正线性相关关系。智能制造企业起步阶段,政府要发挥政策引导作用,鼓励更多企业投入到智能制造企业相关领域,促进其创新关联网络的发展。在发展阶段,提高网络度数中心度、结构洞和关系强度,避免由于过于分散降低智能制造企业创新能力。在成熟阶段,剔除冗余联系,获取有效的网络资源,优化网络结构,进一步保证智能制造企业的创新能力。     

基于邻接信息熵的网络节点重要性识别算法

通过研究节点与其直接相邻和间接相邻节点之间的关联关系,提出了基于邻接信息熵的网络节点重要性识别算法,算法只需获取节点与其直接邻居及间接邻居间的关联关系,通过计算网络各节点的邻接度,进而计算各节点的信息熵,利用节点信息熵的大小表征节点在网络中的重要性.通过对一个基础网络、无向无权ARPA网络和加权有向ARPA网络进行实验仿真,证明该算法对不同类型网络的通用性;利用该算法对网络按节点重要性进行节点删除实验,研究网络形成子网络的数量与规模,证明了算法的准确性.     

基于Matlab仿真的技术创新网络的无标度特征

Joel(2009)认为技术创新网络中连接的形成更多的决定于节点企业阃知识资产的重叠程度,但是现有对技术创新网络的仿真研究大多直接应用了复杂网络研究方法,仅考虑了网络中节点企业的度对网络中新连接形成的影响,较少关注知识资产在网络连接形成中的重要作用,其结论一般是技术创新网络具有小世界网络的特征.本文认为新加入技术创新网...     

Greedysearch based service location in P2P networks

1.INTRODUCTION Mainapplicationsoftoday’sP2Pnetworkincludefile andcyclesharing.InP2Pfilesharingnetworklike Gnutella,resourcesarefilesscatteredondifferent nodes.Therefore,resourcelocationunderthissce narioreferstofindingnodeswithrequiredfiles.On theotherhand,incycle sharingP2Pnetworks,re sourcelocationreferstohuntingidleCPUcyclestodo computationjobs.Forexample,inCondor,which offershigh throughputcomputing,thereisamatch makeracceptingresourcestateinformationandpro vidingmatchingservice…