共查询到20条相似文献,搜索用时 31 毫秒
1.
Normalized entropy of rank distribution: a novel measure of heterogeneity of complex networks 总被引:1,自引:0,他引:1
下载免费PDF全文
![点击此处可从《中国物理》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Many unique properties of complex networks result from heterogeneity. The measure and analysis of heterogeneity are
important and desirable to the research of the properties and
functions of complex networks. In this paper, the rank distribution
is proposed as a new statistic feature of complex networks. Based on
the rank distribution, a novel measure of the heterogeneity called a
normalized entropy of rank distribution (NERD) is proposed. The NERD
accords with the normal meaning of heterogeneity within the context
of complex networks compared with conventional measures. The
heterogeneity of scale-free networks is studied using the NERD. It
is shown that scale-free networks become more heterogeneous as the
scaling exponent decreases and the NERD of scale-free networks is
independent of the number of vertices, which indicates that the NERD
is a suitable and effective measure of heterogeneity for networks
with different sizes. 相似文献
2.
《Physics letters. A》2014,378(16-17):1091-1094
The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks. 相似文献
3.
As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well. 相似文献
4.
5.
Synthesization of high-capacity auto-associative memories using complex-valued neural networks
下载免费PDF全文
![点击此处可从《中国物理 B》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper, a novel design procedure is proposed for synthesizing high-capacity auto-associative memories based on complex-valued neural networks with real-imaginary-type activation functions and constant delays. Stability criteria dependent on external inputs of neural networks are derived. The designed networks can retrieve the stored patterns by external inputs rather than initial conditions. The derivation can memorize the desired patterns with lower-dimensional neural networks than real-valued neural networks, and eliminate spurious equilibria of complex-valued neural networks.One numerical example is provided to show the effectiveness and superiority of the presented results. 相似文献
6.
Fractal and self-similarity are important characteristics of complex networks. The correlation dimension is one of the measures implemented to characterize the fractal nature of unweighted structures, but it has not been extended to weighted networks. In this paper, the correlation dimension is extended to the weighted networks. The proposed method uses edge-weights accumulation to obtain scale distances. It can be used not only for weighted networks but also for unweighted networks. We selected six weighted networks, including two synthetic fractal networks and four real-world networks, to validate it. The results show that the proposed method was effective for the fractal scaling analysis of weighted complex networks. Meanwhile, this method was used to analyze the fractal properties of the Newman–Watts (NW) unweighted small-world networks. Compared with other fractal dimensions, the correlation dimension is more suitable for the quantitative analysis of small-world effects. 相似文献
7.
S. Zhang X.-M. Ning X.-S. Zhang 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,57(1):67-74
There has been a quickly growing interest in properties of complex
networks, such as the small world property, power-law degree
distribution, network transitivity, and community structure, which
seem to be common to many real world networks. In this study, we
consider the community property which is also found in many real
networks. Based on the diffusion kernels of networks, a hierarchical
clustering approach is proposed to uncover the community structure
of different extent of complex networks. We test the method on some
networks with known community structures and find that it can detect
significant community structure in these networks. Comparison with
related methods shows the effectiveness of the method. 相似文献
8.
H. Lin C.-X. Wu 《The European Physical Journal B - Condensed Matter and Complex Systems》2006,51(4):543-547
The congestion transition triggered by multiple walkers
walking along the shortest path on complex networks is numerically
investigated. These networks are composed of nodes that have a
finite capacity in analogy to the buffer memory of a computer. It is
found that a transition from free-flow phase to congestion phase
occurs at a critical walker density fc, which varies for
complex networks with different topological structures. The dynamic
pictures of congestion for networks with different topological
structures show that congestion on scale-free networks is a
percolation process of congestion clusters, while the dynamics of
congestion transition on non-scale-free networks is mainly a process
of nucleation. 相似文献
9.
In this paper, the networks with optimal synchronizability are obtained using the local structure information. In scale-free networks, a node will be coupled by its neighbors with maximal degree among the neighbors if and only if the maximal degree is larger than its own degree. If the obtained coupled networks are connected, they are synchronization optimal networks. The connection probability of coupled networks is greatly affected by the average degree which usually increases with the average degree. This method could be further generalized by taking into account the degree of next-nearest neighbors, which will sharply increase the connection probability. Compared to the other proposed methods that obtain synchronization optimal networks, our method uses only local structure information and can hold the structure properties of the original scale-free networks to some extent. Our method may present a useful way to manipulate the synchronizability of real-world scale-free networks. 相似文献
10.
Robustness of weighted complex networks is analyzed from nonlinear dynamical point of view and with focus on different roles of high-degree and low-degree nodes. We find that the phenomenon for the low-degree nodes being the key nodes in the heterogeneous networks only appears in weakly weighted networks and for weak coupling. For all other parameters, the heterogeneous networks are always highly vulnerable to the failure of high-degree nodes; this point is the same as in the structural robustness analysis. We also find that with random inactivation, heterogeneous networks are always more robust than the corresponding homogeneous networks with the same average degree except for one special parameter. Thus our findings give an integrated picture for the dynamical robustness analysis on complex networks. 相似文献
11.
12.
从复杂网络的节点路径长度范围的角度来研究病毒传播的局域控制,分析了在不同拓扑结构的复杂网络中进行局域控制的有效性.研究表明,局域控制对WS小世界网络、BA无标度网络和ER随机网络三类复杂网络均有效,但只有WS小世界网络存在零感染的控制范围最优值d=3;对于长程连边的分布存在距离偏好的Kleinberg小世界网络,随着依赖度的增大,病毒传播率临界值增加,同时局域范围控制的效果得到加强.
关键词:
复杂网络
病毒传播
局域控制
路径长度 相似文献
13.
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks. 相似文献
14.
Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks. 相似文献
15.
节点中心性指标是从特定角度对网络某一方面的结构特点进行刻画的度量指标, 因此网络拓扑结构的改变会对节点中心性指标的准确性产生重要影响. 本文利用Holme-Kim模型构建可变集聚系数的无标度网络, 然后采用Susceptible-Infective-Removal模型进行传播影响力的仿真实验, 接着分析了节点中心性指标在不同集聚系数的无标度网络中的准确性. 结果表明, 度中心性和介数中心性的准确性在低集聚系数的网络中表现更好, 特征向量中心性则在高集聚类网络中更准确, 而紧密度中心性的准确性受网络集聚系数的变化影响较小. 因此当网络的集聚系数较低时, 可选择度或者介数作为中心性指标进行网络节点影响力评价; 反之则选择紧密度指标或特征向量指标较好, 尤其当网络的集聚系数接近0.6时特征向量的准确性可以高达到0.85, 是度量小规模网络的较优选择. 另一方面, 传播过程的感染率越高, 度指标和介数指标越可靠, 紧密度和特征向量则相反. 最后Autonomous System实证网络的断边重连实验, 进一步验证了网络集聚性的改变会对节点中心性指标的准确性产生重要影响. 相似文献
16.
Shouwei Li Jiaheng Li 《The European Physical Journal B - Condensed Matter and Complex Systems》2016,89(5):116
This paper investigates the impact of social network structures of depositors on bankruns. The analyzed network structures include random networks, small-world networks andscale-free networks. Simulation results show that the probability of bank run occurrencein random networks is larger than that in small-world networks, but the probability ofbank run occurrence in scale-free networks drops from the highest to the lowest among thethree types of network structures with the increase of the proportion of impatientdepositors. The average degree of depositor networks has a significant impact on bankruns, but this impact is related to the proportion of impatient depositors and theconfidence levels of depositors in banks. 相似文献
17.
This article investigates the functional properties of complex
networks used as grid computing systems. Complex networks following
the Erdös-Rényi model and other models with a preferential
attachment rule (with and without growth) or priority to the
connection of isolated nodes are studied. Regular networks are also
considered for comparison. The processing load of the parallel
program executed on the grid is assigned to the nodes on demand, and
the efficiency of the overall computation is quantified in terms of
the parallel speedup. It is found that networks with preferential
attachment allow lower computing efficiency than networks with
uniform link attachment. At the same time, considering only node
clusters of the same size, preferential attachment networks display
better efficiencies. The regular networks, on the other hand,
display a poor efficiency, due to their implied larger internode
distances. A correlation is observed between the topological
properties of the network, specially average cluster size, and their
respective computing efficiency. 相似文献
18.
Oscillation death (also called amplitude death), a phenomenon of coupling induced stabilization of an unstable equilibrium, is studied for an arbitrary symmetric complex network with delay-coupled oscillators, and the critical conditions for its linear stability are explicitly obtained. All cases including one oscillator, a pair of oscillators, regular oscillator networks, and complex oscillator networks with delay feedback coupling, can be treated in a unified form. For an arbitrary symmetric network, we find that the corresponding smallest eigenvalue of the Laplacian λ(N) (0 >λ(N) ≥ -1) completely determines the death island, and as λ(N) is located within the insensitive parameter region for nearly all complex networks, the death island keeps nearly the largest and does not sensitively depend on the complex network structures. This insensitivity effect has been tested for many typical complex networks including Watts-Strogatz (WS) and Newman-Watts (NW) small world networks, general scale-free (SF) networks, Erdos-Renyi (ER) random networks, geographical networks, and networks with community structures and is expected to be helpful for our understanding of dynamics on complex networks. 相似文献
19.
Linear matrix inequality approach to exponential synchronization of a class of chaotic neural networks with time-varying delays
下载免费PDF全文
![点击此处可从《中国物理》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper, a synchronization scheme for a class of chaotic
neural networks with time-varying delays is presented. This class of
chaotic neural networks covers several well-known neural networks,
such as Hopfield neural networks, cellular neural networks, and
bidirectional associative memory networks. The obtained criteria are
expressed in terms of linear matrix inequalities, thus they can be
efficiently verified. A comparison between our results and the
previous results shows that our results are less restrictive. 相似文献
20.
红外光谱评价内燃机油抗氧化性能的研究 总被引:1,自引:1,他引:0
红外光谱快速检测石油产品性能是近年来发展的新技术,目前国内外在该领域的研究仅限于测试燃料油性能,由于润滑油组成、结构复杂,红外光谱技术测试润滑油性能的研究还未见报道。文章研究了润滑油组成、结构的红外光谱特征,提出了根据内燃机油组成、结构对抗氧化性能的贡献来提取其光谱信息的技术路线。结合BP神经网络和自组织神经网络的优点,发展了量化自组织神经网络数学模型,该数学模型具有自组织神经网络的定性聚类功能和BP神经网络的定量分析功能,与BP神经网络相比较,量化自组织神经网络具有更好的鲁棒性,测试结果优于BP神经网络,该论文的研究为润滑油性能的快速检测提供了一种新的技术手段。 相似文献