DeepAI AI Chat
Log In Sign Up

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

06/01/2022
by   Xizhe Zhang, et al.
0

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.

READ FULL TEXT

page 2

page 4

05/25/2023

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 ...
09/15/2021

α-Indirect Control in Onion-like Networks

Tens of thousands of parent companies control millions of subsidiaries t...
05/21/2019

Learning Conserved Networks from Flows

The network reconstruction problem is one of the challenging problems in...
04/30/2022

A Faster Algorithm for Betweenness Centrality Based on Adjacency Matrices

Betweenness centrality is essential in complex network analysis; it char...
02/20/2023

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

Real-world complex network systems often experience changes over time, a...
04/20/2020

Exploring Distributed Control with the NK Model

The NK model has been used widely to explore aspects of natural evolutio...
03/15/2019

Fast influencers in complex networks

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