首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 609 毫秒
1.
Unified index to quantifying heterogeneity of complex networks   总被引:1,自引:0,他引:1  
Hai-Bo Hu 《Physica A》2008,387(14):3769-3780
Although recent studies have revealed that degree heterogeneity of a complex network has significant impact on the network performance and function, a unified definition of the heterogeneity of a network with any degree distribution is absent. In this paper, we define a heterogeneity index 0≤H<1 to quantify the degree heterogeneity of any given network. We analytically show the existence of an upper bound of H=0.5 for exponential networks, thus explain why exponential networks are homogeneous. On the other hand, we also analytically show that the heterogeneity index of an infinite power law network is between 1 and 0.5 if and only if its degree exponent is between 2 and 2.5. We further show that for any power law network with a degree exponent greater than 2.5, there always exists an exponential network such that both networks have the same heterogeneity index. This may help to explain why 2.5 is a critical degree exponent for some dynamic behaviors on power law networks.  相似文献   

2.
We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks.In this model,we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it.The network evolves according to a vertex strength preferential selection mechanism.During the evolution process,the network always holds its total number of vertices and its total number of single-edges constantly.We show analytically and numerically that a network will form steady scale-free distributions with our model.The results show that a weighted non-growth random network can evolve into scale-free state.It is interesting that the network also obtains the character of an exponential edge weight distribution.Namely,coexistence of scale-free distribution and exponential distribution emerges.  相似文献   

3.
We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.  相似文献   

4.
虚拟社区网络的演化过程研究   总被引:4,自引:0,他引:4       下载免费PDF全文
张立  刘云 《物理学报》2008,57(9):5419-5424
模拟了虚拟社区网络的演化过程并研究其拓扑结构.发现虚拟社区网络在演化过程中,节点的加入、边的加入、网络中度分布、节点的度与其加入网络时间的关系、平均度随时间的变化等方面与传统的无标度网络有所不符.根据国内某论坛的实际网络数据统计与分析,提出了虚拟社区网络的演化机理——虚拟社区网络构造算法.仿真结果表明,模拟以互联网论坛为代表的虚拟社区网络时,该模型能够得到与真实网络相符的特性. 关键词: 复杂网络 虚拟社区 无标度网络  相似文献   

5.
In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model. The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc.  相似文献   

6.
In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc.  相似文献   

7.
熊菲  刘云  司夏萌  丁飞 《物理学报》2010,59(10):6889-6895
模拟了Web2.0网络的发展过程并研究其拓扑结构,分析某门户网站实际博客数据的度分布、节点度时间变化,发现与先前的无标度网络模型有所差别.根据真实网络的生长特点,提出了边与节点同时增长的网络模型,包括随机连接及近邻互联的网络构造规则.仿真研究表明,模拟的网络更接近实际,在没有优先连接过程时,模型能得到幂率的度分布;并且网络有更大的聚类系数以及正的度相关性。  相似文献   

8.
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we identify a topological phase transition depending on the rate of node removal and the relative strength of preferential vs. random attachment, where the degree distribution goes from a power law to one with an exponential tail.  相似文献   

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

10.
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.  相似文献   

11.
Gyemin Lee  Gwang Il Kim 《Physica A》2007,383(2):677-686
A network induced by wealth is a social network model in which wealth induces individuals to participate as nodes, and every node in the network produces and accumulates wealth utilizing its links. More specifically, at every time step a new node is added to the network, and a link is created between one of the existing nodes and the new node. Innate wealth-producing ability is randomly assigned to every new node, and the node to be connected to the new node is chosen randomly, with odds proportional to the accumulated wealth of each existing node. Analyzing this network using the mean value and continuous flow approaches, we derive a relation between the conditional expectations of the degree and the accumulated wealth of each node. From this relation, we show that the degree distribution of the network induced by wealth is scale-free. We also show that the wealth distribution has a power-law tail and satisfies the 80/20 rule. We also show that, over the whole range, the cumulative wealth distribution exhibits the same topological characteristics as the wealth distributions of several networks based on the Bouchaud-Mèzard model, even though the mechanism for producing wealth is quite different in our model. Further, we show that the cumulative wealth distribution for the poor and middle class seems likely to follow by a log-normal distribution, while for the richest, the cumulative wealth distribution has a power-law behavior.  相似文献   

12.
We investigate the statistics of the most connected node in scale-free networks. For a scale-free network model with homogeneous nodes, we show by means of extensive simulations that the exponential truncation, due to the finite size of the network, of the degree distribution governs the scaling of the extreme values and that the distribution of maxima follows the Gumbel statistics. For a scale-free network model with heterogeneous nodes, we show that scaling no longer holds and that the truncation of the degree distribution no longer controls the maxima distribution.  相似文献   

13.
Continuous-time branching processes describe the evolution of a population whose individuals generate a random number of children according to a birth process. Such branching processes can be used to understand preferential attachment models in which the birth rates are linear functions. We are motivated by citation networks, where power-law citation counts are observed as well as aging in the citation patterns. To model this, we introduce fitness and age-dependence in these birth processes. The multiplicative fitness moderates the rate at which children are born, while the aging is integrable, so that individuals receives a finite number of children in their lifetime. We show the existence of a limiting degree distribution for such processes. In the preferential attachment case, where fitness and aging are absent, this limiting degree distribution is known to have power-law tails. We show that the limiting degree distribution has exponential tails for bounded fitnesses in the presence of integrable aging, while the power-law tail is restored when integrable aging is combined with fitness with unbounded support with at most exponential tails. In the absence of integrable aging, such processes are explosive.  相似文献   

14.
Xuelian Sun  Enmin Feng 《Physica A》2007,385(1):370-378
In this paper, we analyze an evolving model with local information which can generate a class of networks by choosing different values of the parameter p. The model introduced exhibits the transition from unweighted networks to weighted networks because the distribution of the edge weight can be widely tuned. With the increase in the local information, the degree correlation of the network transforms from assortative to disassortative. We also study the distribution of the degree, strength and edge weight, which all show crossover between exponential and scale-free. Finally, an application of the proposed model to the study of the synchronization is considered. It is concluded that the synchronizability is enhanced when the heterogeneity of the edge weight is reduced.  相似文献   

15.
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter q. We obtain the topological properties of the network including the degree distribution, average path length, diameter, fractal dimensions, and betweenness centrality distribution, which are controlled by parameter q. Interestingly, we show that by adjusting q, the networks undergo a transition from fractal to non-fractal scalings, and exhibit a crossover from ‘large’ to small worlds at the same time. Our research may shed some light on understanding the evolution and relationships of fractal and non-fractal networks.  相似文献   

16.
Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike  , show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter pp, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of pp. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.  相似文献   

17.
Transport networks, such as railway networks and airport networks, are a kind of random network with complex topology. Recently, more and more scholars paid attention to various kinds of transport networks and try to explore their inherent characteristics. Here we study the exponential properties of a recently introduced Bus Transport Networks (BTNs) evolution model with random overlapping clique structure, which gives a possible explanation for the observed exponential distribution of the connectivities of some BTNs of three major cities in China. Applying mean-field theory, we analyze the BTNs model and prove that this model has the character of exponential distribution of the connectivities, and develop a method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the exponents. By comparing mean-field based theoretic results with the statistical data of real BTNs, we observe that, as a whole, both of their data show similar character of exponential distribution of the connectivities, and their exponents have same order of magnitude, which show the availability of the analytical result of this paper.  相似文献   

18.
The exponential degree distribution has been found in many real world complex networks, based on which, the random growing process has been introduced to analyze the formation principle of such kinds of networks. Inspired from the non-equilibrium network theory, we construct the network according to two mechanisms: growing and adjacent random attachment. By using the Kolmogorov-Smirnov Test (KST), for the same number of nodes and edges, we find the simulation results are remarkably consistent with the predictions of the non-equilibrium network theory, and also surprisingly match the empirical databases, such as the Worldwide Marine Transportation Network (WMTN), the Email Network of University at Rovira i Virgili (ENURV) in Spain and the North American Power Grid Network (NAPGN). Our work may shed light on interpreting the exponential degree distribution and the evolution mechanism of the complex networks.  相似文献   

19.
一种新型电力网络局域世界演化模型   总被引:7,自引:0,他引:7       下载免费PDF全文
现实世界中的许多系统都可以用复杂网络来描述,电力系统是人类创造的最为复杂的网络系统之一.当前经典的网络模型与实际电力网络存在较大差异.从电力网络本身的演化机理入手,提出并研究了一种可以模拟电力网络演化规律的新型局域世界网络演化模型.理论分析表明该模型的度分布具有幂尾特性,且幂律指数在3—∞之间可调.最后通过对中国北方电网和美国西部电网的仿真以及和无标度网络、随机网络的对比,验证了该模型可以很好地反映电力网络的演化规律,并且进一步证实了电力网络既不是无标度网络,也不是完全的随机网络. 关键词: 电力网络 演化模型 局域世界 幂律分布  相似文献   

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

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号