DeepAI AI Chat
Log In Sign Up

Control hubs of complex networks and a polynomial-time identification algorithm

by   Xizhe Zhang, et al.

Unveiling the underlying control principles of complex networks is one of the ultimate goals of network science. We introduce a novel concept, control hub, to reveal a cornerstone of the control structure of a network. The control hubs of a network are the nodes that lie in the middle of a control path in every control scheme of the network. We present a theorem based on graph theory for identifying control hubs without computing all control schemes. We develop an algorithm to identify all control hubs in O(N0.5L) time complexity for a network of N nodes and L links.


page 2

page 4


Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3]

In this corrigendum, we give a counterexample to Theorem 5.2 in “On the ...

α-Indirect Control in Onion-like Networks

Tens of thousands of parent companies control millions of subsidiaries t...

Learning Conserved Networks from Flows

The network reconstruction problem is one of the challenging problems in...

A Faster Algorithm for Betweenness Centrality Based on Adjacency Matrices

Betweenness centrality is essential in complex network analysis; it char...

Dynamic Optimal Control: A Real-Time Control Optimization Algorithm for Dynamic Networks

Real-world complex network systems often experience changes over time, a...

Exploring Distributed Control with the NK Model

The NK model has been used widely to explore aspects of natural evolutio...

Fast influencers in complex networks

Influential nodes in complex networks are typically defined as those nod...