一种基于效率矩阵的网络节点重要度评价算法

为了实现对网络节点重要性的有效评价,提出一种基于网络效率矩阵的节点重要度评价算法.该方法综合考虑节点的度值(局部重要度)和网络节点之间的重要性贡献(全局重要度),利用节点的度和效率矩阵表征网络节点的重要度贡献,克服重要性贡献矩阵法中节点只依赖于邻接节点的不足.考虑实际网络的稀疏性,该算法的时间复杂度为O(n²).通过算例分析验证了该算法的可行性和有效性,结果表明:该算法能够更加直观、简单有效地区分节点的重要度差异,并且对于大型复杂网络具有较理想的计算能力.     

源于“团簇-共振”模型的理想金属玻璃电子化学势均衡

理想金属玻璃是指完全满足电子结构稳定性的金属玻璃. 在我们前期工作中提出的“团簇加连接原子"及理想金属玻璃的“团簇-共振"结构模型的 基础上, 本文指出理想金属玻璃应该满足电子化学势均衡判据, 可定量给出团簇与连接原子的比例, 最终确定了理想金属玻璃成分式[团簇](连接原子)_x. 运用此判据, 解析了Cu-Zr基和Co-B基块体金属玻璃, 实验确定的最佳形成能力成分满足电子化学势均衡.     

弛豫铁电体的键能与配位数模型

基于一定浓度的杂质会在钛酸钡型铁电体中导致键能与配位数的高斯型分布原理,利用键能与配位数起伏模型导出了介电峰温与测量频率的关系.当键能和配位数的相对起伏接近时,其关系呈现出一般弛豫铁电体所普遍具有的Vogel-Fulcher函数形式,且冻结温度仅与键能的相对起伏和激活能有关.并由此解释了低掺杂浓度下杂质均匀分布导致弥散性的机理和超过临界浓度时的弛豫铁电性的机理.同时提出,杂质替代对畴的形成和生长所产生的强烈抑制作用及微畴化是实现键能起伏与配位数起伏一致的来源.     

基于概率感知和改进量子遗传算法的节点部署策略

为了最大化监测区域的网络覆盖率和实现网络的负载均衡,设计了一种基于改进概率感知模型和量子遗传算法的移动节点部署方法。首先,在传统概率感知模型中加入环境干扰噪声因素和节点剩余能量因素进而获得改进的概率感知模型,然后,对传统的量子遗传算法进行改进,设计了新的量子旋转门和量子比特变异方式,以加快全局收敛速度和防止陷入局部最优。最后,定义了基于改进量子遗传算法获取移动节点最优部署位置的算法。仿真实验表明：文中方法能有效地对网络区域进行部署,实现最大化网络的覆盖率和最小化能量消耗,与其它方法相比,具有较大的优越性,是一种可行的方法。     

一个描述合作网络顶点度分布的模型

讨论一类社会合作网络以及一些与其拓扑结构相似的技术网络的度分布.建议一个最简化模型，通过解析的方法说明这些网络演化的共同动力学机理，而且说明顶点的度分布和项目度分布之间具有密切的一致关系，而项目所含的顶点数分布对度分布的影响较小；对模型的更一般情况进行数值模拟，说明上述结论具有一定的普遍性.这个模型显示这类广义的合作网络一般具有处于幂函数和指数函数这两种极端情况之间的度分布.简要介绍对一些实际合作网络做统计研究的结果，说明本模型的合理性. 关键词： 合作网络 度分布 项目度分布 项目含顶点数     

基于节点度信息的自愿免疫模型研究

疾病的广泛传播给人类带来了巨大的损失, 因此抑制疾病的传播非常重要. 本文考虑了个体接种疫苗意愿的差异性, 并结合博弈理论建立了一个基于节点度信息的自愿免疫模型. 理论解析结果证明当感染率超过某个阈值时, 该模型与忽略个体接种意愿差异性的经典模型(Zhang et al 2010 New J. Phys. 12 023015) 传播效果(感染节点数)一样. 继而考虑疫苗永久有效和有效期有限两种情况, 在Barabási-Albert网络中利用SIS传播模型对疾病的传播进程进行了数值模拟, 发现数值模拟结果与理论解析结果非常符合. 实验证明, 当感染耗费和接种疫苗耗费相同时, 该模型比忽略个体接种意愿差异性的经典模型能够更好的抑制疾病的传播, 且感染人数下降比例超过65%, 更重要的是,疫苗有效期越长本文的模型 (与忽略个体接种意愿差异性的经典模型相比)抑制疾病传播效果越好. 关键词： 疾病传播 自愿免疫 接种疫苗倾向 节点度     

基于节点非结构模型的换热网络结构多样性分析及改进优化策略

强制进化随机游走算法优化换热网络过程中会出现个体结构相似现象,导致种群结构多样性下降,算法全局搜索能力不足,难以进一步优化换热网络结构.针对基于节点非结构模型的换热网络结构相似现象展开研究,制定两个评价指标衡量优化过程中个体结构相似水平,发现个体结构内相似换热单元数逐步增加,而相似换热单元的热负荷差距逐步减小,个体结构...     

基于相继故障信息的网络节点重要度演化机理分析

分析了过载机制下节点重要度的演化机理.首先,在可调负载重分配级联失效模型基础上,根据节点失效后其分配范围内节点的负载振荡程度,提出了考虑级联失效局域信息的复杂网络节点重要度指标.该指标具有两个特点:一是值的大小可以清晰地指出节点的失效后果;二是可以依据网络负载分配范围、负载分配均匀性、节点容量系数及网络结构特征分析节点重要度的演化情况.然后,给出该指标的仿真算法,并推导了最近邻择优分配和全局择优分配规则下随机网络和无标度网络节点重要度的解析表达式.最后,实验验证了该指标的有效性和可行性,并深入分析了网络中节点重要度的演化机理,即非关键节点如何演化成影响网络级联失效行为的关键节点.     

Ni-Al-Cr合金中团簇加连接原子模型的第一性原理计算

通过团簇加连接原子模型研究了Ni-Al-Cr合金的近程序结构和物理特性.以Al原子为中心,其周围第一近邻的12个Ni原子作为壳层原子,位于次近邻的Al原子和Cr原子作为连接原子,即[Al-Ni₁₂]Al_xCr_3–x,其中x=0, 0.5, 1.0, 1.5, 2.0, 2.5.形成能表明团簇加连接原子模型对应的结构比其他结构更稳定.差分电荷密度显示了Ni, Al, Cr原子间的电荷密度转移主要聚集在Ni-Al和Ni-Cr之间,说明Ni-Al和Ni-Cr之间比AlCr和Ni-Ni更容易成键.能带结构显示了Ni-Al-Cr合金材料均具有导体性质,且Ni-3d, Al-3p和Ni-3d, Cr-3d之间发生了明显杂化效应,验证了Ni-Al和Ni-Cr之间存在较强的相互作用.     

一种基于随机行走和策略连接的网络演化模型

本文提出了一个基于随机行走和策略选择的复杂网络局域演化模型RAPA. 新节点加入系统不需要全局知识,而是通过随机行走构造局域世界;然后依据概率采用随机连接,"扶贫"连接或"亲富"连接策略,从局域世界中选择节点增加连接边;最终自组织演化具有幂律特点的复杂网络. 初步的解析计算和仿真实验都表明,RAPA模型不仅重现了具有小世界特性、整体上的无标度特性,还可以演化出小变量饱和以及指数截断等现象,同时也具有明显的聚类特性,并能够构造出同配或异配等不同混合模式的网络. 关键词： 复杂网络 模型 随机行走 策略连接     

A modified evidential methodology of identifying influential nodes in weighted networks

How to identify influential nodes in complex networks is still an open hot issue. In the existing evidential centrality (EVC), node degree distribution in complex networks is not taken into consideration. In addition, the global structure information has also been neglected. In this paper, a new Evidential Semi-local Centrality (ESC) is proposed by modifying EVC in two aspects. Firstly, the Basic Probability Assignment (BPA) of degree generated by EVC is modified according to the actual degree distribution, rather than just following uniform distribution. BPA is the generation of probability in order to model uncertainty. Secondly, semi-local centrality combined with modified EVC is extended to be applied in weighted networks. Numerical examples are used to illustrate the efficiency of the proposed method.     

A novel method for identifying influential nodes in complex networks based on gravity model

How to identify influential nodes in complex networks is an essential issue in the study of network characteristics. A number of methods have been proposed to address this problem, but most of them focus on only one aspect. Based on the gravity model, a novel method is proposed for identifying influential nodes in terms of the local topology and the global location. This method comprehensively examines the structural hole characteristics and K-shell centrality of nodes, replaces the shortest distance with a probabilistically motivated effective distance, and fully considers the influence of nodes and their neighbors from the aspect of gravity. On eight real-world networks from different fields, the monotonicity index, susceptible-infected-recovered (SIR) model, and Kendall's tau coefficient are used as evaluation criteria to evaluate the performance of the proposed method compared with several existing methods. The experimental results show that the proposed method is more efficient and accurate in identifying the influence of nodes and can significantly discriminate the influence of different nodes.     

节点数加速增长的复杂网络生长模型

受某些实际网络节点数按几何级数增长现象的启发，构造了每个时间步中按当前网络规模成比例地同时加入多个节点的节点数加速增长的网络模型.研究表明，在增长率不是很大的情况下网络度分布仍然是幂律的，但在不同的增长率r下幂律指数是不同的.得到了幂律指数介于2到3之间可调的无标度网络模型，并解析地给出了幂律指数随增长率变化的函数关系.数值模拟还显示，网络的平均最短距离随r减小而簇系数随r增大. 关键词： 复杂网络 无标度网络 生长网络模型 节点数加速增长网络模型     

Ranking the spreading influence of nodes in complex networks: An extended weighted degree centrality based on a remaining minimum degree decomposition

Ranking the spreading influence of nodes is crucial for developing strategies to control the spreading process on complex networks. In this letter, we define, for the first time, a remaining minimum degree (RMD) decomposition by removing the node(s) with the minimum degree iteratively. Based on the RMD decomposition, a weighted degree (WD) is presented by utilizing the RMD indices of the nearest neighbors of a node. WD assigns a weight to each degree of this node, which can distinguish the contribution of each degree to the spreading influence. Further, an extended weighted degree (EWD) centrality is proposed by extending the WD of the nearest neighbors of a node. Assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive experiments on a series of synthetic and real networks to comprehensively evaluate the performance of EWD and other eleven representative measures. The experimental results show that EWD is a relatively efficient measure in running efficiency, it exposes an advantage in accuracy in the networks with a relatively small degree heterogeneity, as well as exposes a competitive performance in resolution.     

Granger-Causality Inference of the Existence of Unobserved Important Components in Network Analysis

Detecting causal interrelationships in multivariate systems, in terms of the Granger-causality concept, is of major interest for applications in many fields. Analyzing all the relevant components of a system is almost impossible, which contrasts with the concept of Granger causality. Not observing some components might, in turn, lead to misleading results, particularly if the missing components are the most influential and important in the system under investigation. In networks, the importance of a node depends on the number of nodes connected to this node. The degree of centrality is the most commonly used measure to identify important nodes in networks. There are two kinds of degree centrality, which are in-degree and out-degree. This manuscrpt is concerned with finding the highest out-degree among nodes to identify the most influential nodes. Inferring the existence of unobserved important components is critical in many multivariate interacting systems. The implications of such a situation are discussed in the Granger-causality framework. To this end, two of the most recent Granger-causality techniques, renormalized partial directed coherence and directed partial correlation, were employed. They were then compared in terms of their performance according to the extent to which they can infer the existence of unobserved important components. Sub-network analysis was conducted to aid these two techniques in inferring the existence of unobserved important components, which is evidenced in the results. By comparing the results of the two conducted techniques, it can be asserted that renormalized partial coherence outperforms directed partial correlation in the inference of existing unobserved important components that have not been included in the analysis. This measure of Granger causality and sub-network analysis emphasizes their ubiquitous successful applicability in such cases of the existence of hidden unobserved important components.     

Projective synchronisation with non-delayed and delayed coupling in complex networks consisting of identical nodes and different nodes

This paper first investigates the projective synchronisation problem with non-delayed and delayed coupling between drive-response dynamical networks consisting of identical nodes and different nodes.Based on Lyapunov stability theory,several nonlinear controllers are applied to achieve the projective synchronisation between the drive-response dynamical networks;simultaneously the topological structure of the drive dynamical complex networks can be exactly identified.Moreover,numerical examples are presented to verify the feasibility and effectiveness of the theorems.     

Oscillation sources and wave propagation paths in complex networks consisting of excitable nodes

Self-sustained oscillations in complex networks consisting of nonoscillatory nodes have attracted long-standing interest in diverse natural and social systems. We study the self-sustained periodic oscillations in random networks consisting of excitable nodes. We reveal the underlying dynamic structure by applying a dominant phase-advanced driving method. The oscillation sources and wave propagation paths can be illustrated clearly via the dynamic structure revealed. Then we are able to control the oscillations with surprisingly high efficiency based on our understanding.     

基于Voronoi图盲区的无线传感器网络覆盖控制部署策略

针对无线传感器网络在二维平面应用场景中的覆盖控制问题, 提出了一种基于泰森盲区多边形形心的覆盖控制部署策略(blind-zone centroid-based scheme, BCBS). BCBS先对监测区域做Voronoi图划分以得到被每个传感器节点覆盖的泰森多边形, 而后根据泰森多边形顶点的覆盖情况分析得出泰森多边形内的盲区, 并构造与盲区形状相近的多边形, 最后以该多边形的几何中心作为传感器节点移动的候选目标位置, 从而达到提高网络覆盖率的目的. 仿真实验结果表明, BCBS在覆盖率、节点分布均匀性与节点覆盖效率等方面相比CBS有明显优势. 关键词： 无线传感器网络 节点覆盖 Voronoi图 多边形形心     

复杂网络牵制控制优化选点算法及节点组重要性排序

本文研究复杂网络动力学模型的无向网络牵制控制的优化选点及节点组重要性排序问题.根据牵制控制的同步准则,网络的牵制控制同步取决于网络的Laplacian删后矩阵的最小特征值.因此,通过合理选择受控节点集得到一个较大的Laplacian删后矩阵最小特征值,是牵制控制优化选点问题的核心所在.基于Laplacian删后矩阵最小...     

Effect of anti-virus software on infectious nodes in computer network: A mathematical model

An e-epidemic model of malicious codes in the computer network through vertical transmission is formulated. We have observed that if the basic reproduction number is less than unity, the infected proportion of computer nodes disappear and malicious codes die out and also the malicious codes-free equilibrium is globally asymptotically stable which leads to its eradication. Effect of anti-virus software on the removal of the malicious codes from the computer network is critically analyzed. Analysis and simulation results show some managerial insights that are helpful for the practice of anti-virus in information sharing networks.