2016
DOI: 10.1038/srep38209
|View full text |Cite
|
Sign up to set email alerts
|

Input graph: the hidden geometry in controlling complex networks

Abstract: The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder: what is the underlying relationship of all possible input nodes? Here we introduce input graph, a simple geometry that reveals the complex relationship between all control schemes and input nodes. We prove that the node adjacent to an input node in the input graph will appea… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
36
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 18 publications
(36 citation statements)
references
References 34 publications
(56 reference statements)
0
36
0
Order By: Relevance
“…For a network of n nodes, a set of driver nodes for the bipartite representation of the network, N D , is found using a maximum matching algorithm such as Hopcroft-Karp [36]. For all N D , control adjacent nodes were identified iteratively and an input graph was created as dictated in Zhang et al [72]. The input graph was used to classify nodes as critical (in all minimum input sets), neutral (in some minimum input sets), or redundant (in no minimum input sets).…”
Section: Global Controllability Classificationmentioning
confidence: 99%
“…For a network of n nodes, a set of driver nodes for the bipartite representation of the network, N D , is found using a maximum matching algorithm such as Hopcroft-Karp [36]. For all N D , control adjacent nodes were identified iteratively and an input graph was created as dictated in Zhang et al [72]. The input graph was used to classify nodes as critical (in all minimum input sets), neutral (in some minimum input sets), or redundant (in no minimum input sets).…”
Section: Global Controllability Classificationmentioning
confidence: 99%
“…For a network of n nodes, a set of driver nodes for the bipartite representation of the network, 6 , is found using a maximum matching algorithm such as Hopcroft-Karp 38 . For all 6 , control adjacent nodes were identified iteratively and an input graph was created as dictated in Zhang et al 68 . The input graph was used to classify nodes as critical (in all minimum input sets), neutral (in some minimum input sets), or redundant (in no minimum input sets).…”
Section: Jia Classificationmentioning
confidence: 99%
“…For most of the real networks, the maximum matching is usually not unique because of their structural complexity. Therefore, there may exist many MDSs which can fully control the network 16,19 .…”
Section: Introductionmentioning
confidence: 99%