IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v12y2021i1d10.1038_s41467-021-25533-3.html
   My bibliography  Save this article

The basis of easy controllability in Boolean networks

Author

Listed:
  • Enrico Borriello

    (Arizona State University)

  • Bryan C. Daniels

    (Arizona State University)

Abstract

Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the effectiveness of external control in selecting a desired final state when that state is among the original attractors of the dynamics. Analyzing 49 existing biological network models, we find strong numerical evidence that the average number of nodes that must be forced scales logarithmically with the number of original attractors. This suggests that biological networks may be typically easy to control even when the number of interacting components is large. We provide a theoretical explanation of the scaling by separating controlling nodes into three types: those that act as inputs, those that distinguish among attractors, and any remaining nodes. We further identify characteristics of dynamics that can invalidate this scaling, and speculate about how this relates more broadly to non-biological systems.

Suggested Citation

  • Enrico Borriello & Bryan C. Daniels, 2021. "The basis of easy controllability in Boolean networks," Nature Communications, Nature, vol. 12(1), pages 1-15, December.
    • Handle: RePEc:nat:natcom:v:12:y:2021:i:1:d:10.1038_s41467-021-25533-3
    DOI: 10.1038/s41467-021-25533-3
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-021-25533-3
    File Function: Abstract
    Download Restriction: no
    File URL: https://libkey.io/10.1038/s41467-021-25533-3?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thomas Parmer & Luis M. Rocha & Filippo Radicchi, 2022. "Influence maximization in Boolean networks," Nature Communications, Nature, vol. 13(1), pages 1-11, December.
    2. Wang, Yong & Zhong, Jie & Pan, Qinyao & Li, Ning, 2024. "Minimal pinning control for set stability of Boolean networks," Applied Mathematics and Computation, Elsevier, vol. 465(C).

    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:nat:natcom:v:12:y:2021:i:1:d:10.1038_s41467-021-25533-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.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.