IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v14y2011i03ns0219525911003098.html
   My bibliography  Save this article

Finding Attractors In Asynchronous Boolean Dynamics

Author

Listed:
  • THOMAS SKODAWESSELY

    (Bioinformatics Group, Institute for Computer Science, Leipzig University, Härtelstrasse 16-18, 04107 Leipzig, Germany)

  • KONSTANTIN KLEMM

    (Bioinformatics Group, Institute for Computer Science, Leipzig University, Härtelstrasse 16-18, 04107 Leipzig, Germany)

Abstract

We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

Suggested Citation

  • Thomas Skodawessely & Konstantin Klemm, 2011. "Finding Attractors In Asynchronous Boolean Dynamics," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 14(03), pages 439-449.
    • Handle: RePEc:wsi:acsxxx:v:14:y:2011:i:03:n:s0219525911003098
    DOI: 10.1142/S0219525911003098
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525911003098
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219525911003098?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:acsxxx:v:14:y:2011:i:03:n:s0219525911003098. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.