Minimum structural controllability problems of complex networks

DOI10.1016/J.PHYSA.2015.09.010zbMATH Open1400.93033OpenAlexW1709545220MaRDI QIDQ1619005FDOQ1619005

Authors: Hong Li Yin, Siying Zhang 

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.09.010

Recommendations

• Controllability and algorithms of complex networks
• scientific article; zbMATH DE number 7156464
• Algorithm for identifying minimum driver nodes based on structural controllability
• Controllability emerging from conditional path reachability in complex networks
• Minimum-cost control of complex networks

zbMATH Keywords

controllabilitystrongly connected componentinput accessibleminimum controlled vertex setminimum driver vertex set

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05)

Cites Work

• Title not available (Why is that?)
• Interconnection topologies for multi-agent coordination under leader-follower framework
• Title not available (Why is that?)
• The robust minimal controllability problem
• Control Profiles of Complex Networks
• A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
• Structural controllability
• Minimal Controllability Problems
• Controllability and Observability of Grid Graphs via Reduction and Symmetries
• Eigenvector perturbations of complex networks
• Characterization of generic properties of linear structured systems for efficient computations.
• Damage attack on complex networks

Cited In (21)

• Controllability of supply chain network and it's minimum control input
• Strong structural controllability of networks
• Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
• Optimal selection of essential interconnections for structural controllability in heterogeneous subsystems
• Block-based minimum input design for the structural controllability of complex networks
• Minimal structural perturbations for controllability of a networked system: complexities and approximations
• Effect of the interdependence between subnets on the structural controllability of complex networks
• On the minimum driver node set of \(k\)-uniform linear hypertree networks
• Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
• Quantitative controllability index of complex networks
• Controllability emerging from conditional path reachability in complex networks
• Structural controllability and observability of complex network with output feedback
• Maximum matchings in a pseudofractal scale-free web
• Title not available (Why is that?)
• Algorithm for identifying minimum driver nodes based on structural controllability
• The minimum rank completion problems for tri-diagonal partial full sign patterns
• Dominating communities for hierarchical control of complex networks
• Dominating complex networks by identifying minimum skeletons
• Structural Controllability of Networks With Dynamical Structured Nodes
• Any quantum network is structurally controllable by a single driving signal
• Controllability and algorithms of complex networks

This page was built for publication: Minimum structural controllability problems of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619005)