新节点的边对网络无标度性影响

分析新节点边对网络无标度性的影响.虽然亚线性增长网络瞬态平均度分布尾部表现出了幂律分布性质，但是，这个网络的稳态度分布并不是幂律分布，由此可见，计算机模拟预测不出网络稳态度分布，它只能预测网络的瞬态度分布.进而建立随机增长网络模型，利用随机过程理论得到了这个模型的度分布的解析表达式，结果表明这个网络是无标度网络.     

新节点的边对网络无标度性影响

分析新节点边对网络无标度性的影响.虽然亚线性增长网络瞬态平均度分布尾部表现出了幂律分布性质,但是,这个网络的稳态度分布并不是幂律分布,由此可见,计算机模拟预测不出网络稳态度分布,它只能预测网络的瞬态度分布.进而建立随机增长网络模型,利用随机过程理论得到了这个模型的度分布的解析表达式,结果表明这个网络是无标度网络. 关键词： 复杂网络 无标度网络 小世界网络 度分布     

幂律指数在1与3之间的一类无标度网络

借助排队系统中顾客批量到达的概念，提出节点批量到达的Poisson网络模型.节点按照到达率为λ的Poisson过程批量到达系统.模型1，批量按照到达批次的幂律非线性增长，其幂律指数为θ(0≤θ<+∞).BA模型是在θ＝0时的特例.利用Poisson过程理论和连续化方法进行分析，发现这个网络稳态平均度分布是幂律分布，而且幂律指数在1和3之间.模型2，批量按照节点到达批次的对数非线性增长，得出当批量增长较缓慢时，稳态度分布幂律指数为3.因此，节点批量到达的Poisson网络模型不仅是BA模型的推广，也为许多幂律指数在1和2之间的现实网络提供了理论依据.     

具有幂率度分布的因特网平均最短路径长度估计

针对具有幂律度分布的复杂网络的平均最短路径长度进行了研究.给出了一个计算因特网平 均最短路径长度的公式.提出因特网的整体构造实质是以最小代价换取最大收益，从此出 发通过对因特网这类复杂网络平均最短路径长度影响因素分析，推断出网络最短路径长度分 布P(l)的基本性质，进而构造了一个只含参数α的P(l)的简洁形式，直接打通了拓扑具有幂 律度分布的因特网的度分布P(k)与网络最短路径长度分布P(l)之间的关系.然后说明了导出 的公式的物理意义，即参数α代表网络节点连接方式和网络的总边数对平均最短路径长 度的影响.此公式意味着只要掌握幂律P(k)～k-α中α值，就可以直接计算相应网 络的平均最短路径长度.通过对已知数据的计算，验证了公式的有效性.阐明了参数 α对网络设计的重要性和对网络功能的影响. 关键词： 复杂网络 幂律 度分布 平均最短路径长度     

基于复杂网络理论的微博用户关系网络演化模型研究

微博给人们提供便利的同时也产生了较大的负面影响.为获取微博谣言的传播规律,进而采取有效措施防控其传播,本文基于复杂网络理论研究微博用户关系网络的内部特征,提出一种微博用户关系网络演化模型,借助于平均场理论,分析该演化模型的拓扑统计特性,以及谣言在该演化模型上的传播动力学行为.理论分析和仿真实验表明,由该模型演化生成的微博用户关系网络具有无标度特性.度分布指数不仅与反向连接概率有关,而且还取决于节点的吸引度分布.研究还发现,与指数分布和均匀分布相比,当节点吸引度满足幂律分布时,稳态时的谣言传播程度较大.此外,随着反向连接概率或节点初始连边数量的增加,谣言爆发的概率以及网络中最终接受谣言的节点数量都会明显增大.     

网络规模衰减的随机生灭网络平均度

在社会和生物网络中,每个智能体都存在生与灭过程,这些演化网络可能存在一些特殊的性质.近年来,这些生灭网络受到了广泛的关注,大部分的生灭网络的研究都聚焦于度分布的求解和它们的性质.本文研究了节点增加概率0p1/2的随机生灭网络在稳态情形下不同规模的网络的平均度,给出了平均度的基本性质和精确求解结果.首先,根据基于随机过程规则(SPR)的Markov链方法,给出了节点度的稳态方程组,由此得到不同网络规模的平均度的递推方程组;其次,根据递推方程组研究了平均度的性质,指出不同网络规模下的平均度严格单调递增收敛于2mq;利用这些性质,运用生成函数法求解出不同网络规模的平均度的精确表达式;最后,采用数值模拟方法验证了平均度的精确求解结果和性质,讨论了平均度与节点增加概率p以及连接数m之间的关系.     

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

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

一种新型二分网络类局域世界演化模型

现实世界中复杂网络的演化存在很明显的局域选择现象,然而目前关于二分网络中的局域世界演化模型研究较少．因此,本文建立了一个基于二分网络的类局域世界演化模型．首先定义了网络节点度值的饱和度．在此基础上提出了一种新型二分网络局域世界演化模型．新节点加入系统不需要全局知识,而是通过节点在网络演化的不同时刻度值饱和度为选择条件构造新节点的局域世界,然后利用择优连接从局域世界中选择节点增加连边完成网络演化．此类模型中新节点的局域世界是通过节点饱和度的限制被动生成,因此又称为类局域世界模型．通过模拟分析发现在节点度值饱和度的限制下择优连接并没有产生具有幂率特性的度分布,而是生成了度分布相对均匀的二分网络,即节点度值分布区间较小．此外,本文还给出了该网络的混合系数计算结果,该结果显示网络同配性与网络参数的选择有关,这一结果与网络邻点平均度的模拟结果一致．     

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

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

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

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

Network evolution by different rewiring schemes

Many real world networks, such as social networks, are characterized by rearrangements of the links between nodes (rewiring). Indeed, very few natural networks are static in time, and it is therefore important to study the properties of networks in which rewiring occurs. In this paper, two different rewiring schemes are formulated and compared using a general ordinary differential equation (ODE) model. The equilibrium distributions are analytically derived. It is found that by uniformly choosing a node and a link connected to it, rewiring from different ends of the link yields different equilibrium degree distributions. Rewiring from the neighbor generally produces more high degree nodes. The equilibrium distributions of the ODE model are compared with simulation results of the corresponding stochastic process for rewiring. Conditions are discussed under which our ODE provides a good approximation for the mean of the corresponding stochastic process.     

Regularity of traffic noise signals

The flexibility of the filtered renewal process compared with the filtered Poisson process as a model for traffic noise is demonstrated. This is done by proving that for the family of gamma distributed headways with coefficient of variation less than one the variance of the traffic noise signal never exceeds that of the corresponding filtered Poisson process. Furthermore it is proved that the inverse inequality holds for the family of completely monotone distributions, which includes all finite mixtures of exponential distributions. The theory is illustrated by some numerical calculations.     

Constraints and entropy in a model of network evolution

Barabási–Albert’s “Scale Free” model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the “Scale Free” model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the “Scale Free” and “constraints” model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.     

Relationship between degree-rank distributions and degree distributions of complex networks

Both the degree distribution and the degree-rank distribution, which is a relationship function between the degree and the rank of a vertex in the degree sequence obtained from sorting all vertices in decreasing order of degree, are important statistical properties to characterize complex networks. We derive an exact mathematical relationship between degree-rank distributions and degree distributions of complex networks. That is, for arbitrary complex networks, the degree-rank distribution can be derived from the degree distribution, and the reverse is true. Using the mathematical relationship, we study the degree-rank distributions of scale-free networks and exponential networks. We demonstrate that the degree-rank distributions of scale-free networks follow a power law only if scaling exponent λ>2. We also demonstrate that the degree-rank distributions of exponential networks follow a logarithmic law. The simulation results in the BA model and the exponential BA model verify our results.     

An anti-attack model based on complex network theory in P2P networks

Complex network theory is a useful way to study many real systems. In this paper, an anti-attack model based on complex network theory is introduced. The mechanism of this model is based on a dynamic compensation process and a reverse percolation process in P2P networks. The main purpose of the paper is: (i) a dynamic compensation process can turn an attacked P2P network into a power-law (PL) network with exponential cutoff; (ii) a local healing process can restore the maximum degree of peers in an attacked P2P network to a normal level; (iii) a restoring process based on reverse percolation theory connects the fragmentary peers of an attacked P2P network together into a giant connected component. In this way, the model based on complex network theory can be effectively utilized for anti-attack and protection purposes in P2P networks.     

Network robustness and fragility: percolation on random graphs

Recent work on the Internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes or links. Such deletions include, for example, the failure of Internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real-world networks, which often possess power-law or other highly skewed degree distributions. In this paper we study percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolation, bond percolation, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understanding of network resilience.     

SPR-based Markov chain method for degree distributions of evolving networks

In this paper, we develop a stochastic process rules (SPR) based Markov chain method to calculate the degree distributions of evolving networks. This new approach overcomes two shortcomings of Shi, Chen and Liu’s use of the Markov chain method (Shi et al. 2005 [21]). In addition we show how an SPR-based Markov chain method can be effectively used to calculate degree distributions of random birth-and-death networks, which we believe to be novel. First SPR are introduced to replace traditional evolving rules (TR), making it possible to compute degree distributions in one sample space. Then the SPR-based Markov chain method is introduced and tested by using it to calculate two kinds of evolving network. Finally and most importantly, the SPR-based method is applied to the problem of calculating the degree distributions of random birth-and-death networks.     

用户需求行为对互联网动力学整体特性的影响

由Internet构成的复杂网络的动力学特性主要受到用户需求行为的影响,具备时域的统计规律性. 通过对区域群体用户需求行为的时域实验统计分析,发现用户对Web网站的访问频度及其生成的二分网络的入度分布也呈现幂律分布和集聚现象,其幂指数介于1.7到1.8之间. 建立了虚拟资源网络VRN和物理拓扑网络PTN双层模型,分析了双层模型映射机理,并对网络用户需求行为进行建模. 虚拟资源网络VRN对物理拓扑网络PTN映射过程的不同机理,模拟了Internet资源网络到物理网络的不同影响模式. 幂律分布的用户需求特性会 关键词： 复杂网络 无标度拓扑 用户需求 相变