اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymmetry based Structure Entropy of Complex Networks
156
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Precisely quantifying the heterogeneity or disorder of a network system is very important and desired in studies of behavior and function of the network system. Although many degree-based entropies have been proposed to measure the heterogeneity of real networks, heterogeneity implicated in the structure of networks can not be precisely quantified yet. Hence, we propose a new structure entropy based on automorphism partition to precisely quantify the structural heterogeneity of networks. Analysis of extreme cases shows that entropy based on automorphism partition can quantify the structural heterogeneity of networks more precisely than degree-based entropy. We also summarized symmetry and heterogeneity statistics of many real networks, finding that real networks are indeed more heterogenous in the view of automorphism partition than what have been depicted under the measurement of degree based entropies; and that structural heterogeneity is strongly negatively correlated to symmetry of real networks.
قيم البحث
اقرأ أيضاً
Many real networks have been found to have a rich degree of symmetry, which is a very important structural property of complex network, yet has been rarely studied so far. And where does symmetry comes from has not been explained. To explore the mech
anism underlying symmetry of the networks, we studied statistics of certain local symmetric motifs, such as symmetric bicliques and generalized symmetric bicliques, which contribute to local symmetry of networks. We found that symmetry of complex networks is a consequence of similar linkage pattern, which means that nodes with similar degree tend to share similar linkage targets. A improved version of BA model integrating similar linkage pattern successfully reproduces the symmetry of real networks, indicating that similar linkage pattern is the underlying ingredient that responsible for the emergence of the symmetry in complex networks.
Cycle is the simplest structure that brings redundant paths in network connectivity and feedback effects in network dynamics. Focusing on cycle structure, this paper defines a new matrix, named cycle number matrix, to represent cycle information of a
network, and an index, named cycle ratio, to quantify the node importance. Experiments on real networks suggest that cycle ratio contains rich information in addition to well-known benchmark indices, for example, the node rankings by cycle ratio are largely different from rankings by degree, H-index, coreness, betweenness and articulation ranking, while the rankings by degree, H-index, coreness are very similar to each other. Extensive experiments on identifying vital nodes that maintain network connectivity, facilitate network synchronization and maximize the early reach of spreading show that cycle ratio is competitive to betweenness and overall better than other benchmarks. We believe the in-depth analyses on cycle structure may yield novel insights, metrics, models and algorithms for network science.
In this paper, we reveal the relationship between entropy rate and the congestion in complex network and solve it analytically for special cases. Finding maximizing entropy rate will lead to an improvement of traffic efficiency, we propose a method t
o mitigate congestion by allocating limited traffic capacity to the nodes in network rationally. Different from former strategies, our method only requires local and observable information of network, and is low-cost and widely applicable in practice. In the simulation of the phase transition for various network models, our method performs well in mitigating congestion both locally and globally. By comparison, we also uncover the deficiency of former degree-biased approaches. Owing to the rapid development of transportation networks, our method may be helpful for modern society.
In this work, we investigate a heterogeneous population in the modified Hegselmann-Krause opinion model on complex networks. We introduce the Shannon information entropy about all relative opinion clusters to characterize the cluster profile in the f
inal configuration. Independent of network structures, there exists the optimal stubbornness of one subpopulation for the largest number of clusters and the highest entropy. Besides, there is the optimal bounded confidence (or subpopulation ratio) of one subpopulation for the smallest number of clusters and the lowest entropy. However, network structures affect cluster profiles indeed. A large average degree favors consensus for making different networks more similar with complete graphs. The network size has limited impact on cluster profiles of heterogeneous populations on scale-free networks but has significant effects upon those on small-world networks.
We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the
networks degree distribution. We rigorously prove that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
