Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStructure controllability of complex network based on preferential matching
132
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.
rate research
Read More
Controlling a complex network towards a desire state is of great importance in many applications. Existing works present an approximate algorithm to find the driver nodes used to control partial nodes of the network. However, the driver nodes obtained by this algorithm depend on the matching order of nodes and cannot get the optimum results. Here we present a novel algorithm to find the driver nodes for target control based on preferential matching. The algorithm elaborately arrange the matching order of nodes in order to minimize the size of the driver nodes set. The results on both synthetic and real networks indicate that the performance of proposed algorithm are better than the previous one. The algorithm may have various application in controlling complex networks.
We present a new layout algorithm for complex networks that combines a multi-scale approach for community detection with a standard force-directed design. Since community detection is computationally cheap, we can exploit the multi-scale approach to generate network configurations with close-to-minimal energy very fast. As a further asset, we can use the knowledge of the community structure to facilitate the interpretation of large networks, for example the network defined by protein-protein interactions.
Network science have constantly been in the focus of research for the last decade, with considerable advances in the controllability of their structural. However, much less effort has been devoted to study that how to improve the controllability of complex networks. In this paper, a new algorithm is proposed to improve the controllability of complex networks by rewiring links regularly which transforms the network structure. Then it is demonstrated that our algorithm is very effective after numerical simulation experiment on typical network models (Erdos-Renyi and scale-free network). We find that our algorithm is mainly determined by the average degree and positive correlation of in-degree and out-degree of network and it has nothing to do with the network size. Furthermore, we analyze and discuss the correlation between controllability of complex networks and degree distribution index: power-law exponent and heterogeneity
Controlling complex networked systems to a desired state is a key research goal in contemporary science. Despite recent advances in studying the impact of network topology on controllability, a comprehensive understanding of the synergistic effect of network topology and individual dynamics on controllability is still lacking. Here we offer a theoretical study with particular interest in the diversity of dynamic units characterized by different types of individual dynamics. Interestingly, we find a global symmetry accounting for the invariance of controllability with respect to exchanging the densities of any two different types of dynamic units, irrespective of the network topology. The highest controllability arises at the global symmetry point, at which different types of dynamic units are of the same density. The lowest controllability occurs when all self-loops are either completely absent or present with identical weights. These findings further improve our understanding of network controllability and have implications for devising the optimal control of complex networked systems in a wide range of fields.
This paper re-introduces the network reliability polynomial - introduced by Moore and Shannon in 1956 -- for studying the effect of network structure on the spread of diseases. We exhibit a representation of the polynomial that is well-suited for estimation by distributed simulation. We describe a collection of graphs derived from ErdH{o}s-Renyi and scale-free-like random graphs in which we have manipulated assortativity-by-degree and the number of triangles. We evaluate the network reliability for all these graphs under a reliability rule that is related to the expected size of a connected component. Through these extensive simulations, we show that for positively or neutrally assortative graphs, swapping edges to increase the number of triangles does not increase the network reliability. Also, positively assortative graphs are more reliable than neutral or disassortative graphs with the same number of edges. Moreover, we show the combined effect of both assortativity-by-degree and the presence of triangles on the critical point and the size of the smallest subgraph that is reliable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
