Related papers: Structure controllability of complex network based…
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…
We investigate to what extent the degree sequence of a directed network constrains the number of driver nodes. We develop a pair of algorithms that take a directed degree sequence as input and aim to output a network with the maximum or…
The problem of controllability of the dynamical state of a network is central in network theory and has wide applications ranging from network medicine to financial markets. The driver nodes of the network are the nodes that can bring the…
We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for…
In pinning control of complex networks, a tacit believing is that the system dynamics will be better controlled by pinning the large-degree nodes than the small-degree ones. Here, by changing the number of pinned nodes, we find that, when a…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…
Liu et al recently proposed a minimum number of driver nodes needed to obtain full structural controllability over a directed network. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most…
The reputation of firms is largely channeled through their ownership structure. We use this relation to determine reputation spillovers between transnational companies and their participated companies in an ownership network core of 1318…
Minimal controllability problem plays an important role in the field of network control. A New concept-Minimum Perfect Critical Set (MPCS)is proposed. Four different MPCSs were found for k-distant tree graphs. Based on this concept of MPCS,…
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size $N$ and power-law exponent $\gamma$, while keeping the average degree fixed. We study ensembles generated by…
Identifying an optimal set of driver nodes to achieve synchronization via pinning control is a fundamental challenge in complex network science, limited by computational intractability and the lack of general theory. Here, leveraging a…
The current driver nodes search methods are difficult to cope with large networks, and the solution process does not consider the node cost. In order to solve the practical control problem of networks with different node costs in finite…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
A controllable network can be driven from any initial state to any desired state using driver nodes. A set of driver nodes to control a network is not unique. It is important to characterize these driver nodes and select the right driver…
The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely…
Our ability to control a whole network can be achieved via a small set of driver nodes. While the minimum number of driver nodes needed for control is fixed in a given network, there are multiple choices for the driver node set. A quantity…
Domination is the fastest-growing field within graph theory with a profound diversity and impact in real-world applications, such as the recent breakthrough approach that identifies optimized subsets of proteins enriched with cancer-related…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. It has been suggested that finding an MIS is equivalent to computing a maximum matching of the network, where…
Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…