Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability
نویسندگان
چکیده
منابع مشابه
A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملStructural Controllability of Complex Networks Based on Preferential Matching
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 c...
متن کاملControllability of structural brain networks
Cognitive function is driven by dynamic interactions between large-scale neural circuits or networks, enabling behaviour. However, fundamental principles constraining these dynamic network processes have remained elusive. Here we use tools from control and network theories to offer a mechanistic explanation for how the brain moves between cognitive states drawn from the network organization of ...
متن کاملa fast approach to the detection of all-purpose hubs in complex networks with chemical applications
a novel algorithm for the fast detection of hubs in chemical networks is presented. thealgorithm identifies a set of nodes in the network as most significant, aimed to be the mosteffective points of distribution for fast, widespread coverage throughout the system. we showthat our hubs have in general greater closeness centrality and betweenness centrality thanvertices with maximal degree, while...
متن کاملControllability Metrics and Algorithms for Complex Networks
This paper studies the problem of controlling complex networks, that is, the joint problem of selecting a set of control nodes and of designing a control input to steer the network to a target state. For this problem (i) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, (ii) we derive bounds based on the system dynamics (network ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2017
ISSN: 2325-5870
DOI: 10.1109/tcns.2016.2553366