度关联无标度网络上的有倾向随机行走

有倾向随机行走是研究网络上数据包路由策略的有效方法. 由于许多真实技术网络包括互联网都具有负的度关联特征, 因此本文研究这种网络上的有倾向随机行走性质. 研究表明: 在负关联网络上粒子可以在连接度较大的节点上均匀分布, 而连接度小的节点上粒子较少; 负关联网络上随机行走的速度比非关联网络更快; 找到了负关联网络上的最佳倾向性系数, 在此情况下负关联网络上随机行走的速度远快于非关联网络. 负关联网络既可以利用度小的节点容纳粒子, 又可以利用度大的节点快速传输, 这是负关联网络上高行走效率产生的机制.     

基于度的正/负相关相依网络模型及其鲁棒性研究

利用典型的Barabási-Albert无标度网络构建了基于度的正/负相关相依网络模型, 该模型考虑子网络间的相依方式及相依程度, 主要定义了两个参数F和K, F表示相依节点比例, K表示相依冗余度. 在随机攻击及基于度的蓄意攻击模式下, 针对网络的级联失效问题, 研究了不同的F值和K值对该相依网络模型鲁棒性的影响, 与随机相依网络模型进行了对比研究. 仿真结果表明:无论是随机相依或是基于度的正/负相关相依网络, 其鲁棒性都是随着F的增大而减弱, 随着K的增大而增强; 在随机攻击下, 全相依模式(F=1)时, 基于度正相关相依网络模型鲁棒性最优, 部分相依模式 (F =0.2, 0.5, 0.8)时, 基于度的负相关相依网络模型则表现出更好的鲁棒性. 而在基于度的蓄意攻击下, 无论F为何值, 基于度的正相关相依网络模型表现出弱鲁棒性.     

手机通话网络度特征分析

手机通信数据详细记录了人们的通信行为, 成为研究人们社会关系、行为模式的重要资源. 通话号码个数、通话次数和时长是手机通信网络的基本属性. 本文在复杂网络理论基础上, 应用统计的方法研究了中国西部某城市三百余万手机用户不同节假日和工作日的 四天通话数据在不同尺度下的号码度、通话度、时长度的分布以及平均号码度、 平均通话度、平均时长度的特征.研究表明, 所有尺度下, 号码度、通话度、时长度均为幂律分布, 幂指数随尺度、日期和指标的不同而不同, 在[1.3, 4] 范围内波动.总体上, 号码度幂指数大于通话度和时长度幂指数, 入度幂指数大于出度幂指数;节假日幂指数大于相应指标的工作日幂指数, 休息时段幂指数大于工作时段幂指数;与工作日相比, 节假日的平均号码度和平均通话度较小, 平均时长度较大.揭示了绝大多数用户每日只接打1个号码的电话, 节假日期间接打电话的用户数、次数、时长减少, 但平均通话时长增大的特征. 关键词： 手机通话网络 复杂网络 度分布 通话模式     

A model of the effects of authority on consensus formation in adaptive networks: Impact on network topology and robustness

Opinions of individuals in real social networks are arguably strongly influenced by external determinants, such as the opinions of those perceived to have the highest levels of authority. In order to model this, we have extended an existing model of consensus formation in an adaptive network by the introduction of a parameter representing each agent’s level of ‘authority’, based on their opinion relative to the overall opinion distribution. We found that introducing this model, along with a randomly varying opinion convergence factor, significantly impacts the final state of converged opinions and the number of interactions required to reach that state. We also determined the relationship between initial and final network topologies for this model, and whether the final topology is robust to node removals. Our results indicate firstly that the process of consensus formation with a model of authority consistently transforms the network from an arbitrary initial topology to one with distinct measurements in mean shortest path, clustering coefficient, and degree distribution. Secondly, we found that subsequent to the consensus formation process, the mean shortest path and clustering coefficient are less affected by both random and targeted node disconnection. Speculation on the relevance of these results to real world applications is provided.     

Geographical networks: geographical effects on network properties

Complex networks describe a wide range of systems in nature and society. Since most real systems exist in certain physical space and the distance between the nodes has influence on the connections, it is helpful to study geographical complex networks and to investigate how the geographical constrains on the connections affect the network properties. In this paper, we briefly review our recent progress on geographical complex networks with respect of statistics, modelling, robustness, and synchronizability. It has been shown that the geographical constrains tend to make the network less robust and less synchronizable. Synchronization on random networks and clustered networks is also studied.      

无标度立体Koch网络的建立及其结构性质研究

根据经典Koch曲线的构造,利用四面体作为迭代基元构造了一种立体Koch网络并对其结构性质做了研究, 给出了该网络的度分布函数,计算了该网络的团簇系数、平均最短路径长度以及度关联函数.结果表明,所构建的网络是无标度网络,度分布临界指数γ≈332;其团簇系数趋向于常数值0870435;平均路径长度与网络尺寸的对数呈正比关系,说明该网络具有小世界网络特性.另外,计算结果表明k_nn(k)随k的变化而变化,说明该Koch网络具有一定的度关联性.     

无标度立体Koch网络的建立及其结构性质研究

根据经典Koch曲线的构造,利用四面体作为迭代基元构造了一种立体Koch网络并对其结构性质做了研究,给出了该网络的度分布函数,计算了该网络的团簇系数、平均最短路径长度以及度关联函数.结果表明,所构建的网络是无标度网络,度分布临界指数γ≈3.32;其团簇系数趋向于常数值0.870435;平均路径长度与网络尺寸的对数呈正比关系,说明该网络具有小世界网络特性.另外,计算结果表明knn(k)随k的变化而变化,说明该Koch网络具有一定的度关联性.     

Analysis of robustness of urban bus network

In this paper,the invulnerability and cascade failures are discussed for the urban bus network.Firstly,three static models(bus stop network,bus transfer network,and bus line network) are used to analyse the structure and invulnerability of urban bus network in order to understand the features of bus network comprehensively.Secondly,a new way is proposed to study the invulnerability of urban bus network by modelling two layered networks,i.e.,the bus stop-line network and the bus line-transfer network and then the interactions between different models are analysed.Finally,by modelling a new layered network which can reflect the dynamic passenger flows,the cascade failures are discussed.Then a new load redistribution method is proposed to study the robustness of dynamic traffic.In this paper,the bus network of Shenyang City which is one of the biggest cities in China,is taken as a simulation example.In addition,some suggestions are given to improve the urban bus network and provide emergency strategies when traffic congestion occurs according to the numerical simulation results.     

An exponential distribution network

A complex network with an exponential distribution p(k)\propto\e^{{-\frac{k}{k_{c}}}}with k _c =3.50±0.02 is introduced and found to have assortative correlation k _i ⁿⁿ =B+qk _i (q>0) from numerical simulation.     

一种基于离散数据从局部到全局的网络重构算法

网络的结构和功能彼此相互影响,网络上的功能往往体现为网络上的动力学过程,网络上的动力学过程通过网络中的行为表象数据进行体现.因此,根据网络上可观测的相关数据对网络结构进行重构将成为可能.本文拟解决如何根据网络上可观测的离散数据还原网络拓扑结构的问题,提出了在网络局部利用每一条离散数据对应节点的相似程度来推测节点间发生连...     

无标度立体Koch网络上随机游走的平均吸收时间

作为一种基本的动力学过程,复杂网络上的随机游走是当前学术界研究的热点问题,其中精确计算带有陷阱的随机游走过程的平均吸收时间(mean trapping time,MTT)是该领域的一个难点.这里的MTT定义为从网络上任意一个节点出发首次到达设定陷阱的平均时间.本文研究了无标度立体Koch网络上带有一个陷阱的随机游走问题,解析计算了陷阱置于网络中度最大的节点这一情形的网络MTT指标.通过重正化群方法,利用网络递归生成的模式,给出了立体Koch网络上MTT的精确解,所得计算结果与数值解一致,并且从所得结果可以看出,立体Koch网络的MTT随着网络节点数N呈线性增长.最后,将所得结果与之前研究的完全图、规则网络、Sierpinski网络和T分形网络进行比较,结果表明Koch网络具有较高的传输效率.     

中国城市航空网络的实证研究与分析

以城市为节点，城市间直航线路为边，实证地研究了中国城市航空网络的拓扑性质.研究表明，中国城市航空网络是一个小世界网络，具有短的平均路径长度和大的簇系数，且其度分布服从双段幂律分布.它的度度相关性质与世界航空网络和北美航空网络都不相同.当度较小时，世界航空网络和北美航空网络都是正相关的，但中国城市航空网络未表现出度度相关性；而对于度较大的节点，世界航空网络中其邻点平均度几乎是一个常值，但中国城市航空网络却呈现出负相关性.以往的实证研究暗示，节点具有明确几何位置的网络，如计算机互联网、电力网络等，不表现层次性.但是中国城市航空网络展现出明显的层次性，表明地理因素对其结构演化的影响并不强烈.进一步地，以城市间直航计划每周提供的座位数为边权，研究了网络的含权性质，发现该网络节点度权之间是幂律相关的，相关指数为1.37.     

Evaluation of network robustness using a node tearing algorithm

Until recently the study of failure and vulnerability in complex networks focused on the role of high degree nodes, and the relationship between their removal and network connectivity. Recent evidence suggested that in some network configurations, the removal of lower degree nodes can also cause network fragmentation. We present a disassembling algorithm that identifies nodes that are core to network connectivity. The algorithm is based on network tearing in which communities are defined and used to construct a hierarchical structure. Cut-nodes, which are located at the boundaries of the communities, are the key interest. Their importance in the overall network connectivity is characterized by their participation with neighbouring communities in each level of the hierarchy. We examine the impact of these cut-nodes by studying the change in size of the giant component, local and global efficiencies, and how the algorithm can be combined with other community detection methods to reveal the finer internal structure within a community.     

Effects of average degree of network on an order-disorder transition in opinion dynamics

We have investigated the influence of the average degree \langle k \rangle of network on the location of an order--disorder transition in opinion dynamics. For this purpose, a variant of majority rule (VMR) model is applied to Watts--Strogatz (WS) small-world networks and Barab\'{a}si--Albert (BA) scale-free networks which may describe some non-trivial properties of social systems. Using Monte Carlo simulations, we find that the order--disorder transition point of the VMR model is greatly affected by the average degree \langle k \rangle of the networks; a larger value of \langle k \rangle results in a more ordered state of the system. Comparing WS networks with BA networks, we find WS networks have better orderliness than BA networks when the average degree \langle k \rangle is small. With the increase of \langle k \rangle, BA networks have a more ordered state. By implementing finite-size scaling analysis, we also obtain critical exponents \beta/\nu, \gamma/\nu and 1/\nu for several values of average degree \langle k \rangle. Our results may be helpful to understand structural effects on order--disorder phase transition in the context of the majority rule model.     

利用节点效率评估复杂网络功能鲁棒性

为了克服现有复杂网络鲁棒性研究模型只考虑节点失效的局部影响性和网络拓扑鲁棒性的缺陷, 提出了一种利用节点效率来评估复杂网络功能鲁棒性的方法. 该方法综合考虑节点失效的全局影响性, 利用网络中节点的效率来定义各节点的负载、极限负载和失效模型, 通过打击后网络中最终失效节点的比例来衡量网络的功能鲁棒性, 并给出了其评估优化算法. 实验分析表明该方法对考虑节点负载的复杂网络功能鲁棒性的评定可行有效, 对于大型复杂网络可以获得理想的计算能力.     

增长速度对合作网络参与者节点度分布的影响

采用率方程对合作网络自组织演化模型进行解析,得到参与者节点度分布服从Yule-Simon分布,这种分布可以用漂移幂律分布近似.分析参与者节点增长速度与参与者节点度分布之间的关系,发现随节点增长速度加快,参与者节点度分布远离幂律,表明节点增长速度是除优先连接之外的另一个影响合作网络拓扑性质的重要因素.通过对城市公交网络和科研合作网络的实证研究,验证了度分布解析结果的正确性.结合实证研究,探讨了合作网络中参与者节点增长速度的形成机制及其实际意义.     

简易广义合作网络度分布的稳定性

本文对简易广义合作网络的三类特殊情形（择优连接、随机连接、混合连接）进行了研究. 基于马氏链理论, 给出它们度分布稳定性存在的严格证明, 并且得到相应网络度分布和度指数的精确表达式. 特别地, 对于混合连接情况, 说明在连线方式中只要存在择优成分, 网络度分布就服从幂律分布, 即所得网络为无标度网络. 关键词： 简易广义合作网络 无标度网络 马氏链 度分布     

基于信息熵的社交网络观点演化模型

随着网络服务的发展,社交网络逐渐成为信息传播的新媒介.因此,研究网络舆情演化具有重要意义和实用价值.为了更好地研究网络舆论,在信息熵的基础上,提出了一个社交网络观点演化模型.此模型存在以下两个特点:一是可以反映个体面对正负两种观点趋向做出抉择时的心理过程;二是可以反映个体形成新观点时主观因素和客观因素的影响.在仿真实验中,讨论了舆论环境对个体观点演化的影响,初始观点和自信度对观点演化的影响,以及意见领袖对群体观点演化的影响.实验结果表明,该模型可以反映真实社交网络中个体的心理学特征,比如个体的观点形成会受到舆论环境的影响,自信的个体不愿意接受他人的观点,当意见领袖存在时群体的观点会受到影响等.     

The effects of nonlinear interactions and network structure in small group opinion dynamics

We present a model of opinion dynamics in social networks in which an individual's opinion evolves under the action of (i) a linear force which tends to restore the opinion back towards the individual's natural bias that is his or her initial opinion and (ii) a nonlinear coupling with other individuals which acts to bring opinions closer together but wanes for high opinion discrepancies. Bifurcation analysis for the case of a two-person group shows that a critical value for the difference in natural biases exists which demarcates regimes of qualitatively different behavior. For low to moderate natural bias differences, the dynamics are qualitatively similar to linear theory. For high bias differences, the system takes on a binary nature and is marked by discontinuous transitions between deadlock and consensus as well as hysteresis as the coupling is varied. The coupling required to force consensus grows extremely rapidly with the natural bias difference indicating that trying to achieve group consensus solely via increasing the communications rate becomes fruitless as the biases become extremely divergent. We also show that, for high bias differences, a triad broker network topology can reduce group discord more effectively than a clique, contrary to linear theory.     

基于扩展度的复杂网络传播影响力评估算法

对网络中节点的传播影响力进行评估具有十分重要的意义, 有助于促进有益或抑制有害信息的传播. 目前, 多种中心性指标可用于对节点的传播影响力进行评估, 然而它们一般只有当传播率处于特定范围时才能取得理想的结果. 例如, 度值中心性指标在传播率较小时较为合适, 而半局部中心性和接近中心性指标则适用于稍大一些的传播率. 为了解决各种评估指标对传播率敏感的问题, 提出了一种基于扩展度的传播影响力评估算法. 算法利用邻居节点度值叠加的方式对节点度的覆盖范围进行了扩展, 使不同的扩展层次对应于不同的传播率, 并通过抽样测试确定了适合于特定传播率的层次数. 真实和模拟数据集上的实验结果表明, 通过扩展度算法得到的扩展度指标能在不同传播率下对节点的传播影响力进行有效评估, 其准确性能够达到或优于利用其他中心性指标进行评估的结果.