Key node selection in minimum-cost control of complex networks

DOI10.1016/J.PHYSA.2017.05.090zbMATH Open1499.93007OpenAlexW2620739531MaRDI QIDQ2146809FDOQ2146809

Jie Ding, Guoqi Li, Changyun Wen

Publication date: 21 June 2022

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

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

zbMATH Keywords

complex networkskey nodeminimum-cost control problemMonte-Carlo realizations

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Controllability (93B05) Decentralized systems (93A14) Networked control (93B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Exploring complex networks
• The robust minimal controllability problem
• Minimum cost input/output design for large-scale linear structural systems
• Control Profiles of Complex Networks
• Scale-Free Networks
• Structural controllability
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Minimal Controllability Problems
• Cooperative Optimal Control for Multi-Agent Systems on Directed Graph Topologies
• On Submodularity and Controllability in Complex Dynamical Networks
• Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems
• Minimum-cost control of complex networks

Cited In (2)

• Sufficient control of complex networks
• Title not available (Why is that?)

This page was built for publication: Key node selection in minimum-cost control of complex networks

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