IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6657307.html
   My bibliography  Save this article

Optimizing Network Controllability with Minimum Cost

Author

Listed:
  • Xiao Wang
  • Linying Xiang
  • Ning Cai

Abstract

In this paper, the issue of optimally modifying the structure of a directed network to guarantee its structural controllability is investigated. Given a directed network, in order to obtain a structurally controllable system, a framework for finding the minimum number of directed edges that need to be added to the network is proposed. After we get these edge-addition configurations, we further calculate the network cost of each optimization scheme and choose the one with the minimum cost. Our main contribution is twofold: first, we provide an algorithm able to find all optimal network modifications in polynomial time; second, we provide a way to calculate the cost of optimizing the network based on the node betweenness. Numerical simulations are given to illustrate the theoretical results.

Suggested Citation

  • Xiao Wang & Linying Xiang & Ning Cai, 2021. "Optimizing Network Controllability with Minimum Cost," Complexity, Hindawi, vol. 2021, pages 1-13, January.
    • Handle: RePEc:hin:complx:6657307
    DOI: 10.1155/2021/6657307
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6657307.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2021/6657307.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/6657307?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6657307. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.