Characterizing short-term stability for Boolean networks over any distribution of transfer functions

Journal Article · Tue Jul 05 00:00:00 EDT 2016 · Physical Review E

DOI:https://doi.org/10.1103/PhysRevE.94.012301· OSTI ID:1338403

Seshadhri, C. ^[1]; Smith, Andrew M. ^[2]; Vorobeychik, Yevgeniy ^[3]; Mayo, Jackson R. ^[2]; Armstrong, Robert C. ^[2]

---

1. Univ. of California, Santa Cruz, CA (United States)
2. Sandia National Lab. (SNL-CA), Livermore, CA (United States)
3. Vanderbilt Univ., Nashville, TN (United States)

Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

• Research Organization: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• Grant/Contract Number: AC04-94AL85000
• OSTI ID: 1338403
• Alternate ID(s): OSTI ID: 1260301
• Report Number(s): SAND2016-12902J; PLEEE8; 650102; TRN: US1701803
• Journal Information: Physical Review E, Vol. 94, Issue 1; ISSN 2470-0045
• Publisher: American Physical Society (APS)
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING